andopp

3 ms·

1.
by andopp 5y ago
Say you have a 10 000 word list. In the beginning all those are candidates. Picking for instance SMOKE might give you a response that is only compatible with 1 000 words. You won’t know that before you guess it. But you can check, for any p
2.
by andopp 5y ago
Imagine you have made a few guesses already. Then you have a set of candidate solutions; words that are compatible with the responses you’ve gotten from the game so far. The question then is, what word from the list of legal words should yo
3.
by andopp 5y ago
Oh I misunderstood the comment I was replying to. Sometimes it is better to repeat letters, because it's a balance between discovering letters and figuring out the order.
4.
by andopp 5y ago
When I tried with the /usr/share/dict/words dictionary it guessed "raise" first, so I can confirm it's a great way to start the game.
5.
by andopp 5y ago
There is also /usr/share/dict/words or https://github.com/dwyl/english-words which can be used.
6.
by andopp 5y ago
I think it's better to not repeat too much from previous guesses. I don't think my greedy algorithm is optimal, and also there are multiple ways to define "optimal". For instance, you might optimize average number of mov
7.
by andopp 5y ago
I try to cut it down to as small a set of candidates as possible. Any reason to think a different split is better?
8.
by andopp 5y ago
Cool! I made a solver myself, yesterday. For every move, it ranks each legal word based on how much information that word will gain. It figures this out by trying all possible solutions that are still compatible with the information acquire