The following pages link to (Q4457558):
Displaying 15 items.
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- The number of pessimistic guesses in Generalized Mastermind (Q987843) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
- Bounds for the static permutation mastermind game (Q2222951) (← links)
- The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) (Q2285139) (← links)
- The worst case number of questions in generalized AB game with and without white-peg answers (Q2341748) (← links)
- Bounding memory for Mastermind might not make it harder (Q2355703) (← links)
- On the strong metric dimension of tetrahedral diamond lattice (Q2516507) (← links)
- Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory (Q2946054) (← links)
- An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs (Q2958353) (← links)
- (Q4660333) (← links)
- Tactile Tools for Teaching: Implementing Knuth's Algorithm for Mastering Mastermind (Q4690077) (← links)
- Optimal strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)
- On metric dimension of edge comb product of vertex-transitive graphs (Q6669579) (← links)
