On the Query Complexity of Black-Peg AB-Mastermind
Polydisciplinary Faculty Ouarzazate, University Ibn Zohr, Agadir 80000, Morocco
Department of Computer Science, Kiel University, 24118 Kiel, Germany
Author to whom correspondence should be addressed.
Received: 8 November 2017 / Revised: 22 December 2017 / Accepted: 28 December 2017 / Published: 2 January 2018
PDF [326 KB, uploaded 26 January 2018]
Mastermind is a two players zero sum game of imperfect information. Starting with Erdős and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the second player, called “codebreaker”, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the codemaker after each guess. For variants that allow color repetition, Doerr et al. (2016) showed optimal results. In this paper, we consider the so called Black-Peg variant of Mastermind, where the only information concerning a guess is the number of positions in which the guess coincides with the secret code. More precisely, we deal with a special version of the Black-Peg game with n
colors where no repetition of colors is allowed. We present upper and lower bounds on the number of guesses necessary to break the secret code. For the case
, the secret code can be algorithmically identified within less than
queries. This result improves the result of Ker-I Ko and Shia-Chung Teng (1985) by almost a factor of 2. For the case
, we prove an upper bound of
. Furthermore, we prove a new lower bound of n
for the case
, which improves the recent
bound of Berger et al. (2016). We then generalize this lower bound to k
queries for the case
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
El Ouali, M.; Glazik, C.; Sauerland, V.; Srivastav, A. On the Query Complexity of Black-Peg AB-Mastermind. Games 2018, 9, 2.
El Ouali M, Glazik C, Sauerland V, Srivastav A. On the Query Complexity of Black-Peg AB-Mastermind. Games. 2018; 9(1):2.
El Ouali, Mourad; Glazik, Christian; Sauerland, Volkmar; Srivastav, Anand. 2018. "On the Query Complexity of Black-Peg AB-Mastermind." Games 9, no. 1: 2.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.