References
- Doerr B, Doerr C, Spöhel R, Thomas H. Playing mastermind with many colors. J ACM. 2016;63(5):1–23. DOI: 10.1145/2987372.
- El Ouali M, Glazik C, Sauerland V, Srivastav A. On the query complexity of Black-Peg AB-mastermind. Games. 2018;9(1):2. DOI: 10.3390/g9010002.
- Larcher M, Martinsson A, Steger A. Solving static permutation mastermind using O(n log n) queries. 2021. arXiv preprint arXiv:2103.02527.
- Martinsson A, Su P. Mastermind with a linear number of queries. 2020. arXiv preprint arXiv:2011.05921
- 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.
- Short MB. Winning Wordle Wisely—or how to ruin a fun little internet game with math. Math Intell. 2022;44(3): 227–237. DOI: 10.1007/s00283-022-10202-0.
- 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.
- Rosenbaum W. Finding a winning strategy for Wordle is NP-complete. 2022. arXiv preprint arXiv:2204.04104.
- Hamkins JD. Infinite Wordle and the mastermind numbers. 2022. arXiv preprint arXiv:2203.06804.
- Hall P. On representatives of subsets. J London Math Soc. 1935;s1–10:26–30. DOI: 10.1112/jlms/s1-10.37.26.