Bounds for static black-peg AB mastermind
From MaRDI portal
Publication:1708631
DOI10.1007/978-3-319-71147-8_28zbMath1474.91026OpenAlexW2770596650MaRDI QIDQ1708631
Jan Schiemann, Gerold Jäger, Christian Glazik, Anand Srivastav
Publication date: 26 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-71147-8_28
Related Items (3)
The exact query complexity of yes-no permutation mastermind ⋮ Bounds for the static permutation mastermind game ⋮ 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