You’ve got ~170k possible words and a pure higher/lower signal, so with perfect play it’s just binary search. Number the words 1 to 170k, guess the middle, then keep halving the range. In binary terms, each guess is basically telling you whether the next bit is 0 or 1.
Since log₂(170,000) ≈ 17.4, you need at most 18 guesses. On average it’s a bit less: about half the words take 18 guesses, a quarter take 17, an eighth take 16, etc. So the expected number of guesses works out to 17.
All of that assumes you know the exact ordering of the dictionary, of course. Once you don’t, it stops being optimal and starts being human. That’s where the difficulty actually comes from.
How are you getting the 170,000 number? I did a quick search and found this quote from merriam-webster.com [1]:
> Webster's Third New International Dictionary, Unabridged, together with its 1993 Addenda Section, includes some 470,000 entries. The Oxford English Dictionary, Second Edition, reports that it includes a similar number.
As a crossword lover, I’ve toyed with the idea of making a digital-first word game that combines clues to find hidden answers with linked letters.
This take allows for other features not present in traditional crosswords to be introduced, for example, different levels of difficulty (i.e. more letters paired = easier and viceversa) or having more flexibility when it comes to clue-making.
agreed, an endless mode would be nice. perhaps it's not implemented by-design to keep us coming back - it's certainly going to work on me. opening the game in a new private tab will let you make another attempt :)
reply