On Optimal Strategies for Wordle and General Guessing Games
Abstract
The recent popularity of Wordle has revived interest in guessing games. We develop a general method for finding optimal strategies for guessing games while avoiding an exhaustive search. Our main contribution are several theorems that build towards a general theory to prove optimality of a strategy for a guessing game. This work is developed to apply to any guessing game, but we use Wordle as an example to present concrete results.
Cite
Text
Cunanan and Thielscher. "On Optimal Strategies for Wordle and General Guessing Games." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/615Markdown
[Cunanan and Thielscher. "On Optimal Strategies for Wordle and General Guessing Games." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/cunanan2023ijcai-optimal/) doi:10.24963/IJCAI.2023/615BibTeX
@inproceedings{cunanan2023ijcai-optimal,
title = {{On Optimal Strategies for Wordle and General Guessing Games}},
author = {Cunanan, Michael and Thielscher, Michael},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2023},
pages = {5541-5548},
doi = {10.24963/IJCAI.2023/615},
url = {https://mlanthology.org/ijcai/2023/cunanan2023ijcai-optimal/}
}