On the algorithmic complexity of the Mastermind game with black-peg results
From MaRDI portal
Publication:989451
DOI10.1016/j.ipl.2009.02.021zbMath1197.91063OpenAlexW2045496672MaRDI QIDQ989451
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.021
2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Related Items (13)
On the query complexity of black-peg AB-mastermind ⋮ Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Query complexity of mastermind variants ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ The number of pessimistic guesses in generalized black-peg mastermind ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Ranking-based black-box complexity ⋮ Playing mastermind with constant-size memory ⋮ The Query Complexity of Finding a Hidden Permutation ⋮ 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
Cites Work
This page was built for publication: On the algorithmic complexity of the Mastermind game with black-peg results
