Query complexity of mastermind variants
From MaRDI portal
Publication:1690229
DOI10.1016/j.disc.2017.11.004zbMath1410.91125arXiv1607.04597OpenAlexW2963057655MaRDI QIDQ1690229
Matthew Stone, Aaron Berger, Christopher Chute
Publication date: 19 January 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04597
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Combinatorial games (91A46)
Related Items (3)
On the query complexity of black-peg AB-mastermind ⋮ Unnamed Item ⋮ The exact query complexity of yes-no permutation mastermind
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mastermind
- On the algorithmic complexity of the Mastermind game with black-peg results
- On the query complexity of black-peg AB-mastermind
- The number of pessimistic guesses in generalized black-peg mastermind
- The worst case number of questions in generalized AB game with and without white-peg answers
- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
- Playing Mastermind With Many Colors
- On the number of queries necessary to identify a permutation
- Optimal reconstruction of graphs under the additive model
This page was built for publication: Query complexity of mastermind variants