> 4. specifically, does analyzing the set of blind solutions permit eliminating certain words from the original list Certainly for some words. If the sought-fo

> 4. specifically, does analyzing the set of blind solutions permit eliminating certain words from the original list Certainly for some words. If the sought-for word has 3 identical letters (example: “ERROR”), no guess can give you 5 yellow squares (to get 5 yellow squares, you’d need to have 3 R’s in your guess, but there are only 2 incorrect positions for placing an R) So, if one of the guesses produces 5 yellow squares, the solution isn’t such a word. (and yes, 5 yellow squares can occur, for example when the word is CARET and the guess TRACE) Because of the lack of regularity in the word list, I think that fully answering all your questions requires exhaustive analysis. That would be fairly simple, though. For every word in your list, compute the set of blind solutions for all other words, and check which of these sets are unique and which aren’t.