# On Optimal Strategies for Wordle and General Guessing Games

arXiv: https://arxiv.org/abs/2305.09111 · HTML: https://mlsanity.com/paper/2305.09111/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 35 references that are in the map.
- First posted on arXiv 16 May 2023.

## Builds on (most cited first, 1 of 1)

- [An Optimal Mastermind (4,7) Strategy and More Results in the Expected Case](https://mlsanity.com/paper/1305.1010/) (2013)

## Abstract (arXiv)

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 contributions are several theorems that build towards a general theory to prove the 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.