Playing Mastermind With Constant-Size Memory - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Playing Mastermind With Constant-Size Memory

Benjamin Doerr
Carola Winzen

Résumé

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.
Fichier principal
Vignette du fichier
27.pdf (584.39 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00678182 , version 1 (03-02-2012)

Identifiants

  • HAL Id : hal-00678182 , version 1

Citer

Benjamin Doerr, Carola Winzen. Playing Mastermind With Constant-Size Memory. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.441-452. ⟨hal-00678182⟩

Collections

STACS2012
40 Consultations
213 Téléchargements

Partager

Gmail Facebook X LinkedIn More