Publication:4132291
From MaRDI portal
zbMath0358.90075MaRDI QIDQ4132291
Publication date: 1977
91A05: 2-person games
Related Items
Guessing bank PINs by winning a mastermind game, Mastermind, Conformant plans and beyond: principles and complexity, The number of pessimistic guesses in Generalized Mastermind, On the algorithmic complexity of the Mastermind game with black-peg results, Efficient solutions for mastermind using genetic algorithms, On the query complexity of black-peg AB-mastermind, Query complexity of mastermind variants, The number of pessimistic guesses in generalized black-peg mastermind, A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem, Solving static permutation mastermind using \(O(n \log n)\) queries, The exact query complexity of yes-no permutation mastermind, Playing mastermind with constant-size memory, 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, On the metric dimension of Cartesian powers of a graph, The Query Complexity of Finding a Hidden Permutation, Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory, An Introduction to Security API Analysis
