Autor:	Doerr, Benjamin, Winzen, Carola
Rok vydání:	2011
Předmět:	Computer Science - Data Structures and Algorithms Computer Science - Neural and Evolutionary Computing F.2.2
Druh dokumentu:	Working Paper
Popis:	We analyze the classic board game of Mastermind with $n$ holes and a constant number of colors. A result of Chv\'atal (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. Comment: 23 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1110.3619 Zobrazit plný text záznamu View this record from Arxiv