Background
My girlfriend started playing the NYT Spelling Bee game (along with all the others). I decided it would be fun to try to write a solver that would print out potential solutions in order of how many points each would give you.
I grabbed an extensive wordlist with 344,812 entries.
This would produce a good amount of false positives, but these aren’t penalized by the game.
The next thing to implement is a rule that words using all of the tiles gain an extra 7 points.
This was added next.
After this I realized that it would be useful to send the output to a file so I created an -f flag that would send the possible solutions to a file prefixed with the day’s date.
To Use
Clone the repository and enter the directory using a CLI.
Run ./solver.py -f and enter the letters one at a time as instructed.
A solutions.txt file prefixed by the days date will be generated.
This is a list of words and the points they score, with the highest scoring words first.
Further Improvements
- Create a UI for users that are CLI-challenged.
- Refine wordlist to remove words that would never be used.
Repository
The code can be found at: