Playing several variants of mastermind with constant-size memory is not harder than with unbounded memory
2015 (English)In: Combinatorial Algorithms: 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / [ed] Kratochvíl Jan, Mirka Miller, Dalibor Froncek, Springer Berlin/Heidelberg, 2015, 188-199 p.Conference paper (Refereed)
We investigate a version of the Mastermind game, where the codebreaker may only store a constant number of questions and answers, called Constant-Size Memory Mastermind, which was recently introduced by Doerr and Winzen. We concentrate on the most difficult case, where the codebreaker may store only one question and one answer, called Size-One Memory Mastermind. We consider two variants of the game: the original one, where the answer is coded with white and black pegs, and the simplified one, where only black pegs are used in the answer. We show that for two pegs and an arbitrary number of colors, the number of questions needed by the codebreaker in an optimal strategy in the worst case for these games is equal to the corresponding number of questions in the games without a memory restriction. In other words, for these cases restricting the memory size does not make the game harder for the codebreaker. This is a continuation of a result of Doerr and Winzen, who showed that this holds asymptotically for a fixed number of colors and an arbitrary number of pegs. Furthermore, by computer search we determine additional pairs (p, c), where again the numbers of questions in an optimal strategy in the worst case for Size-One Memory Mastermind and original Mastermind are equal.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2015. 188-199 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8986
Game theory, Logic game, Mastermind, Space complexity
IdentifiersURN: urn:nbn:se:umu:diva-100113DOI: 10.1007/978-3-319-19315-1_17ISI: 000365044500017ISBN: 978-3-319-19314-4ISBN: 978-3-319-19315-1OAI: oai:DiVA.org:umu-100113DiVA: diva2:790217
25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014