Bounds for static black-peg AB mastermind

DOI10.1007/978-3-319-71147-8_28MaRDI QIDQ1708631zbMATH OpenOpenAlexFDO

Authors Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71147-8_28

Mathematics Subject Classification ID

Combinatorial games (91A46)

Recommendations

• An optimal strategy for static black-peg Mastermind with two pegs
• On the query complexity of black-peg AB-mastermind
• Bounds for the static permutation mastermind game
• An optimal strategy for static black-peg mastermind with three pegs

Cited in

(9)

• scientific article; zbMATH DE number 2061809 (Why is no real title available?)
• Bounds for the static permutation mastermind game
• An optimal strategy for static black-peg Mastermind with two pegs
• Optimal strategies for the static black-peg AB game with two and three pegs
• An optimal strategy for static black-peg mastermind with three pegs
• The exact query complexity of yes-no permutation mastermind
• The worst case number of questions in generalized AB game with and without white-peg answers
• On the query complexity of black-peg AB-mastermind
• The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)

This page was built for publication: Bounds for static black-peg AB mastermind

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708631)