scientific article; zbMATH DE number 2061809
From MaRDI portal
Publication:4457558
zbMATH Open1108.91018MaRDI QIDQ4457558FDOQ4457558
Publication date: 25 March 2004
Title of this publication is not available (Why is that?)
Cited In (15)
- The number of pessimistic guesses in Generalized Mastermind
- Bounding memory for Mastermind might not make it harder
- Query complexity of mastermind variants
- Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
- The number of pessimistic guesses in generalized black-peg mastermind
- Conformant plans and beyond: principles and complexity
- Bounds for the static permutation mastermind game
- Tactile Tools for Teaching: Implementing Knuth's Algorithm for Mastering Mastermind
- Optimal strategies for the static black-peg AB game with two and three pegs
- The worst case number of questions in generalized AB game with and without white-peg answers
- The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
- An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs
- On the strong metric dimension of tetrahedral diamond lattice
- On metric dimension of edge comb product of vertex-transitive graphs
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457558)
