Goodrich, M. T. (2009). On the algorithmic complexity of the Mastermind game with black-peg results. Information processing letters, 109(13), 675-678. https://doi.org/10.1016/j.ipl.2009.02.021
Chicago-Zitierstil (17. Ausg.)Goodrich, Michael T. "On the Algorithmic Complexity of the Mastermind Game with Black-peg Results." Information Processing Letters 109, no. 13 (2009): 675-678. https://doi.org/10.1016/j.ipl.2009.02.021.
MLA-Zitierstil (9. Ausg.)Goodrich, Michael T. "On the Algorithmic Complexity of the Mastermind Game with Black-peg Results." Information Processing Letters, vol. 109, no. 13, 2009, pp. 675-678, https://doi.org/10.1016/j.ipl.2009.02.021.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.