Publication:4297758
From MaRDI portal
zbMath0925.90392MaRDI QIDQ4297758
Publication date: 11 September 1994
91A05: 2-person games
Related Items
Guessing bank PINs by winning a mastermind game, Conformant plans and beyond: principles and complexity, The number of pessimistic guesses in Generalized Mastermind, Efficient solutions for mastermind using genetic algorithms, On the query complexity of black-peg AB-mastermind, The number of pessimistic guesses in generalized black-peg mastermind, An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system, The worst case number of questions in generalized AB game with and without white-peg answers, Bounding memory for Mastermind might not make it harder, Strategy optimization for deductive games, Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory, An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs