1 Search Results for "Winzen, Carola"

Document
DOI: 10.4230/LIPIcs.STACS.2012.441
Playing Mastermind With Constant-Size Memory

Authors: Benjamin Doerr and Carola Winzen

Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)

Abstract
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.
Cite as

Benjamin Doerr and Carola Winzen. Playing Mastermind With Constant-Size Memory. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 441-452, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{doerr_et_al:LIPIcs.STACS.2012.441,
  author =	{Doerr, Benjamin and Winzen, Carola},
  title =	{{Playing Mastermind With Constant-Size Memory}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{441--452},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{D\"{u}rr, Christoph and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.441},
  URN =		{urn:nbn:de:0030-drops-34112},
  doi =		{10.4230/LIPIcs.STACS.2012.441},
  annote =	{Keywords: Algorithms, Mastermind, black-box complexity, memory-restricted algorithms, query complexity}
}
  • Refine by Author
  • 1 Doerr, Benjamin
  • 1 Winzen, Carola

  • Refine by Classification

  • Refine by Keyword
  • 1 Algorithms
  • 1 Mastermind
  • 1 black-box complexity
  • 1 memory-restricted algorithms
  • 1 query complexity

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2012

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact