An Optimal Mastermind (4,7) Strategy and More Results in the Expected Case
Not on the map. Why?
Abstract (arXiv)
This paper presents an optimal strategy for solving the 4 peg-7 color Mastermind MM(4,7) in the expected case (4.676) along with optimal strategies or upper bounds for other values. The program developed is using a depth-first branch and bound algorithm relying on tight upper bound, dynamic lower bound evaluation and guess equivalence to prune symmetric tree branches.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 5 May 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023On Optimal Strategies for Wordle and General Guessing Games16 May 2023