AB (game)

AB, a variant of the board game Mastermind, is a number guessing game involving two players. The codemaker makes a four-digit number with no repeats, and the codebreaker tries to guess this number in as few moves as possible. When the codebreaker makes a guess, the codemaker says the amount of “A”s, or the correct digits in the number as well as in the right place, and the amount of “B”s, or the correct digits in the number that is not in the right place.^[1]^[2]^[3]

References

^ "Solving the AB Game by Brute Force". luckytoilet.wordpress.com. November 8, 2011.
^ Jäger, Gerold; Peczarski, Marcin (2015). "The worst case number of questions in Generalized AB game with and without white-peg answers". Discrete Applied Mathematics. 184: 20–31. arXiv:1306.1713. doi:10.1016/j.dam.2014.10.032. S2CID 6738048.
^ Ouali, Mourad El; Glazik, Christian; Sauerland, Volkmar; Srivastav, Anand (2016). "On the Query Complexity of Black-Peg AB-Mastermind". arXiv:1611.05907 [cs.DS].

External links

AB website implementation by Mu-An

This game-related article is a stub. You can help Wikipedia by expanding it.

[1] "Solving the AB Game by Brute Force". luckytoilet.wordpress.com. November 8, 2011.

[Jäger_Peczarski_2015_pp._20–31-2] Jäger, Gerold; Peczarski, Marcin (2015). "The worst case number of questions in Generalized AB game with and without white-peg answers". Discrete Applied Mathematics. 184: 20–31. arXiv:1306.1713. doi:10.1016/j.dam.2014.10.032. S2CID 6738048.

[Ouali_Glazik_Sauerland_Srivastav_p.-3] Ouali, Mourad El; Glazik, Christian; Sauerland, Volkmar; Srivastav, Anand (2016). "On the Query Complexity of Black-Peg AB-Mastermind". arXiv:1611.05907 [cs.DS].

[1]

[2]

[3]