3 ms·
Why not simply choose a guess which narrows the set of possible solutions the most? This could be improved by looking one step further, but this would probably
by RivieraKid 5y ago
Why not simply choose a guess which narrows the set of possible solutions the most?
This could be improved by looking one step further, but this would probably require some kind of optimization / heuristic / approximation to make it computationally feasible.
- tomlockwood 5y agoWatch this space :D
- Retric 5y agoIt really depends on what you are trying to optimize. Least guesses on average may not want a 50/50 split it might want say a 60/40 split where the 60% is 2 guesses and the 40% is 3. But that loses to a 48:52 split which gives 2 guess 80% of the time etc.
- noxvilleza 5y agoNarrowing the search space greedily doesn't solve the problem optimally, because the size of the search space is just a heuristic. Some search spaces of size X might be more difficult to reduce further than another search space of size Y (for Y < X). This is more apparent in hard mode where you have a very limited guess-pool. The greedy heuristic approach would work fine if all possible 5-letter combinations were valid answers.
- RivieraKid 5y agoI know, like I said in my comment, this greedy strategy could be improved.