Playing Mastermind with Constant-Size Memory |
| |
Authors: | Benjamin Doerr Carola Winzen |
| |
Affiliation: | 1. D1: Algorithms and Complexity, Max Planck Institute for Informatics, Campus E1 4, 66123, Saarbrücken, Germany
|
| |
Abstract: | We analyze the classic board game of Mastermind with n holes and a constant number of colors. The classic result of Chvátal (Combinatorica 3:325–329, 1983) states that the codebreaker can find the secret code with Θ(n/logn) 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 Comput. Syst. 39:525–544, 2006) on the memory-restricted black-box complexity of the OneMax function class. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|