On Optimal Strategies for Wordle and General Guessing Games

Michael Cunanan; Michael Thielscher

IJCAI 2023poster0 citations

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.

Search: S: Combinatorial search and optimisationMultidisciplinary Topics and Applications: MDA: Game playingSearch: S: Applications

BibTeX

@inproceedings{ijcai2023p615,
  title     = {On Optimal Strategies for Wordle and General Guessing Games},
  author    = {Cunanan, Michael and Thielscher, Michael},
  booktitle = {Proceedings of the Thirty-Second International Joint Conference on
               Artificial Intelligence, {IJCAI-23}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {Edith Elkind},
  pages     = {5541--5548},
  year      = {2023},
  month     = {8},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2023/615},
  url       = {https://doi.org/10.24963/ijcai.2023/615},
}