Playing Mastermind with Wordle-like feedback. (English) Zbl 1541.91054
Summary: We introduce an extension of Mastermind called Clear Mastermind with enhanced feedback inspired by that from Wordle. The only difference between Clear Mastermind and Mastermind is a rule that provides more precise feedback, as found in Wordle. In Clear Mastermind, the feedback contains the positions of the colors the codebreaker guessed correctly and the positions of colors that appear in the answer but in different positions. We explore the fewest number of guesses that a codebreaker requires to find the answer in Clear Mastermind according to its two parameters: the number of colors and the length of the answer.
Keywords:
Clear MastermindReferences:
| [1] | Doerr, B, Doerr, C, Spöhel, R, Thomas, H.Playing mastermind with many colors. J ACM. 2016;63(5):1-23. DOI: . · Zbl 1425.91078 |
| [2] | El Ouali, M, Glazik, C, Sauerland, V, Srivastav, A.On the query complexity of Black-Peg AB-mastermind. Games. 2018;9(1):2. DOI: . · Zbl 1403.91074 |
| [3] | Larcher, M, Martinsson, A, Steger, A.Solving static permutation mastermind using \(O(n\text{log}n)\) queries. 2021. arXiv preprint arXiv:2103.02527. |
| [4] | Martinsson, A, Su, P.Mastermind with a linear number of queries. 2020. arXiv preprint arXiv:2011.05921 |
| [5] | Bertsimas, D, Paskov, A.An exact and interpretable solution to Wordle. 2022. Available from: https://auction-upload-files.s3.amazonaws.com/Wordle_Paper_Final.pdf. |
| [6] | Short, MB.Winning Wordle Wisely—or how to ruin a fun little internet game with math. Math Intell. 2022;44(3): 227-237. DOI: . · Zbl 1515.00010 |
| [7] | Lokshtanov, D, Bernardo, S.Wordle Is NP-Hard. In: Fraigniaud, P, Uno, Y, editors. Leibniz International Proceedings in Informatics. Vol. 226. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. p.19:1-19:8. |
| [8] | Rosenbaum, W.Finding a winning strategy for Wordle is NP-complete. 2022. arXiv preprint arXiv:2204.04104. |
| [9] | Hamkins, JD.Infinite Wordle and the mastermind numbers. 2022. arXiv preprint arXiv:2203.06804. |
| [10] | Hall, P.On representatives of subsets. J London Math Soc. 1935;s1-10:26-30. DOI: . · JFM 61.0067.01 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
