Bounding memory for Mastermind might not make it harder

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 for 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. We show that this also holds for the black-peg variant and three pegs. 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)(p,c), where again the numbers of questions for an optimal strategy in the worst case for Size-One Memory Mastermind and original Mastermind are equal.