|
It seems clear to me that there is an optimal starting word, but that the best second word has to depend on the info you gain from the first. Case in point: If you get 3 green 2 yellow in the first word, you can solve on the next guess. Of course, you can constrain your strategies to "I always use the same two/three starting words", and in many cases that will be fine. But it's quite obviously not optimal. Also, the optimal strategy must depend on your goal metric. Do you go for "least average guesses", "least maximum guesses", or "least average guesses while never losing"? There's lots of unstated assumptions in all the analyses thrown around... |
I took one step further and calculated the optimal starting word for obtaining green matches (I assume that this also makes it likely to produce yellow matches, although I did not explicitly optimize for that).
Beginning with the full list of 5-letter words, I calculated the frequency of each letter of the alphabet in each of the 5 possible positions for a 5 letter word.
Then I iterated through the list a second time, this time assigning a score for each word equal to the sum of frequencies for each letter in its respective position.
By a significant margin, the highest score is SLATE (over 1400). Runners up (over 1300) are SAUTE, SHIRE, and CRATE.
Caveat: this approach assumes that all possible words are equally likely to be the answer.