An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs

DOI10.1007/978-3-319-48749-6_48zbMath1484.91087OpenAlexW2543518261MaRDI QIDQ2958353

Gerold Jäger

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_48

zbMATH Keywords

game theorystrategylogic gamestatic Mastermind

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Related Items (2)

Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guessing bank PINs by winning a mastermind game
• Mastermind
• The number of pessimistic guesses in Generalized Mastermind
• On the algorithmic complexity of the Mastermind game with black-peg results
• The number of pessimistic guesses in generalized black-peg mastermind
• Playing mastermind with constant-size memory
• 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
• Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
• Playing Mastermind With Many Colors

This page was built for publication: An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs