On the Query Complexity of Black-Peg AB-Mastermind
AbstractMastermind 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 holes and
Share & Cite This Article
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.Chicago/Turabian Style
El Ouali, Mourad; Glazik, Christian; Sauerland, Volkmar; Srivastav, Anand. 2018. "On the Query Complexity of Black-Peg AB-Mastermind." Games 9, no. 1: 2.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.