scientific article; zbMATH DE number 3559318

Cited in

(27)

On the algorithmic complexity of the Mastermind game with black-peg results
Efficient solutions for mastermind using genetic algorithms
Bounding memory for Mastermind might not make it harder
The number of pessimistic guesses in generalized black-peg mastermind
Query complexity of mastermind variants
Mastermind
Finding a hidden code by asking questions
Playing Guess Who with your kids: code-word strategy against adversaries
Conformant plans and beyond: principles and complexity
Solving static permutation mastermind using \(O(n \log n)\) queries
Taking complete finite prefixes to high level, symbolically
An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system
An introduction to security API analysis
Playing mastermind with constant-size memory
Guessing bank PINs by winning a mastermind game
scientific article; zbMATH DE number 7650068 (Why is no real title available?)
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
The number of pessimistic guesses in Generalized Mastermind
The query complexity of finding a hidden permutation
On the metric dimension of Cartesian powers of a graph
Mastermind with a linear number of queries
Strategy optimization for deductive games
The exact query complexity of yes-no permutation mastermind
The worst case number of questions in generalized AB game with and without white-peg answers
On the query complexity of black-peg AB-mastermind
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132291)