2026-09-30T13:26:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3411 2026-09-29T22:31:08Z ddc:004 open_access

Playing Mastermind With Constant-Size Memory Doerr, Benjamin Winzen, Carola Algorithms Mastermind black-box complexity memory-restricted algorithms query complexity We analyze the classic board game of Mastermind with n holes and a constant number of colors. The classic result of Chvatal (Combinatorica 3 (1983), 325-329) states that the codebreaker can find the secret code with Theta(n / log n) questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006), 525-544) on the memory-restricted black-box complexity of the OneMax function class. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benjamin Doerr and Carola Winzen 2012 Is Part Of LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2012.441 urn:nbn:de:0030-drops-34112 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.441 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode