Earlier quoted context omitted.
I've written a Wordle solver in F#. It's interesting because your first word contains the five most probable letters. My solver starts off by selecting, at random, one of the possible words that have these five letters. Could you say more how you've determined your solver to be deterministic in 6 steps? Also, I'm not sure I understand what this means: > It selects a word to minimize the number of words assuming the w…
So, my algorithm is deterministic because there isn't any random element in it. And then it appears the adversarial doesn't either because the game plays out the same way every time. So, to generate a single guess, the algorithm will basically try every single word in the dictionary against every possible remaining word. For any given guess, it tracks the count of various possible scorings. The scorings are the posit…
My solver is a naive one at the moment, where I've only done a little analysis to get a good starting word. From there, my solver just tracks the results from each guess and randomly selects a word that meets the constraints for the next guess. That actually works surprisingly well, and it hasn't failed Wordle yet.
I've been meaning to go back and do a more thorough analysis and create a more targeted strategy.