Bounds for the static permutation mastermind game

DOI10.1016/J.DISC.2020.112253MaRDI QIDQ2222951zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

game theorygraph theorystatic permutation mastermindvertex cover

Mathematics Subject Classification ID

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

Recommendations

• Solving static permutation mastermind using \(O(n \log n)\) queries
• Bounds for static black-peg AB mastermind
• The exact query complexity of yes-no permutation mastermind

Cites work

• Bounds for static black-peg AB mastermind
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Guessing bank PINs by winning a mastermind game
• scientific article; zbMATH DE number 2061809 (Why is no real title available?)
• scientific article; zbMATH DE number 3026527 (Why is no real title available?)
• Minimal coverings of pairs by triples
• On the number of queries necessary to identify a permutation
• On the query complexity of black-peg AB-mastermind
• The difference between consecutive primes. II
• The number of pessimistic guesses in generalized black-peg mastermind
• The number of pessimistic guesses in Generalized Mastermind
• The worst case number of questions in generalized AB game with and without white-peg answers

Cited in

(9)

• Query complexity of mastermind variants
• Bounds for static black-peg AB mastermind
• The query complexity of a permutation-based variant of mastermind
• Solving static permutation mastermind using \(O(n \log n)\) queries
• The exact query complexity of yes-no permutation mastermind
• The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
• scientific article; zbMATH DE number 2061809 (Why is no real title available?)
• Optimal strategies for the static black-peg AB game with two and three pegs
• On the algorithmic complexity of the Mastermind game with black-peg results

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)