scientific article; zbMATH DE number 2061809

MaRDI QIDQ4457558zbMATH OpenFDO

Authors Wayne Goddard

Publication date 25 March 2004

zbMATH Keywords

minimum size list

Mathematics Subject Classification ID

Combinatorial games (91A46)

Recommendations

• Bounds for the static permutation mastermind game
• An optimal strategy for static black-peg Mastermind with two pegs
• Solving static permutation mastermind using \(O(n \log n)\) queries
• Bounds for static black-peg AB mastermind
• An optimal strategy for static black-peg mastermind with three pegs

Cited in

(15)

• Bounding memory for Mastermind might not make it harder
• The number of pessimistic guesses in generalized black-peg mastermind
• On the strong metric dimension of tetrahedral diamond lattice
• Query complexity of mastermind variants
• Conformant plans and beyond: principles and complexity
• Bounds for the static permutation mastermind game
• An optimal strategy for static black-peg Mastermind with two pegs
• Tactile tools for teaching: implementing Knuth's algorithm for mastering Mastermind
• Optimal strategies for the static black-peg AB game with two and three pegs
• Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
• The number of pessimistic guesses in Generalized Mastermind
• scientific article; zbMATH DE number 2148779 (Why is no real title available?)
• The worst case number of questions in generalized AB game with and without white-peg answers
• The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
• On metric dimension of edge comb product of vertex-transitive graphs

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 Q4457558)