2 ms·
If you want to get really fancy, a full minimax solution is probably feasible without massive resources. Pretend it’s a two player game with one player guessing
by amluto 5y ago
If you want to get really fancy, a full minimax solution is probably feasible without massive resources. Pretend it’s a two player game with one player guessing and the other player thinking of a potentially different word for each guess subject to the constraint of being consistent with all previous answers.
- ummonk 5y agoSomebody had already tweeted about solving it and finding that 3 guesses suffice, using alpha beta search (though he didn’t use the term “alpha beta” because he might have reinvented it). Unfortunately, I can’t seem to dig up the tweet.
- ford 5y agoThere is a wordle parody (absurdle) [0] that does exactly this. [0] https://qntm.org/files/wordle/ https://qntm.org/files/wordle/
- pxx 5y agoNo it does not. It uses a heuristic at every layer of the tree. Specifically, instead of recursing down each subtree, it chooses the set with the maximum number of remaining elements, which isn't necessarily the set that is most difficult to split.
- ford 5y agoI see - I misunderstood the parent comment. I believe you are saying that the best adversary would attempt to maximize the depth of the tree. For example a branch with "{L, B, C, R, ..}ake" requires more guesses than a balanced tree despite the fact that the two trees may have the same number of nodes.
- sdwr 5y agoIf you want to split hairs, minimax is optimal for worst-case, but not for bringing down the average # of guesses.