Bounds for the static permutation mastermind game
From MaRDI portal
Publication:2222951
DOI10.1016/J.DISC.2020.112253zbMATH Open1457.91114OpenAlexW3115812840MaRDI QIDQ2222951FDOQ2222951
Authors: Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav 
Publication date: 27 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112253
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The difference between consecutive primes. II
- Minimal coverings of pairs by triples
- Guessing bank PINs by winning a mastermind game
- The number of pessimistic guesses in Generalized Mastermind
- Title not available (Why is that?)
- On the query complexity of black-peg AB-mastermind
- The number of pessimistic guesses in generalized black-peg mastermind
- Bounds for static black-peg AB mastermind
- The worst case number of questions in generalized AB game with and without white-peg answers
- Playing Mastermind with many colors
- On the number of queries necessary to identify a permutation
Cited In (9)
- On the algorithmic complexity of the Mastermind game with black-peg results
- Solving static permutation mastermind using \(O(n \log n)\) queries
- Query complexity of mastermind variants
- The query complexity of a permutation-based variant of mastermind
- Bounds for static black-peg AB mastermind
- The exact query complexity of yes-no permutation mastermind
- Optimal strategies for the static black-peg AB game with two and three pegs
- The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
- Title not available (Why is that?)
This page was built for publication: Bounds for the static permutation mastermind game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222951)
