scientific article; zbMATH DE number 2061809
From MaRDI portal
Publication:4457558
zbMath1108.91018MaRDI QIDQ4457558
Publication date: 25 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory ⋮ Query complexity of mastermind variants ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ The number of pessimistic guesses in generalized black-peg mastermind ⋮ Bounds for the static permutation mastermind game ⋮ Conformant plans and beyond: principles and complexity ⋮ The number of pessimistic guesses in Generalized Mastermind ⋮ Tactile Tools for Teaching: Implementing Knuth's Algorithm for Mastering Mastermind ⋮ The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ The worst case number of questions in generalized AB game with and without white-peg answers ⋮ Bounding memory for Mastermind might not make it harder
This page was built for publication:
