文章基本信息

标题：Playing Mastermind With Constant-Size Memory
本地全文：下载
作者：Benjamin Doerr ; Carola Winzen
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2012
卷号：14
页码：441-452
DOI：10.4230/LIPIcs.STACS.2012.441
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Algorithms; Mastermind; black-box complexity; memory-restricted algorithms; query complexity