scientific article; zbMATH DE number 3559318

Cited in

(27)

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

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)