Pages that link to "Item:Q1944171"
From MaRDI portal
The following pages link to The number of pessimistic guesses in generalized black-peg mastermind (Q1944171):
Displaying 15 items.
- Guessing bank PINs by winning a mastermind game (Q692940) (← links)
- The number of pessimistic guesses in Generalized Mastermind (Q987843) (← links)
- On the algorithmic complexity of the Mastermind game with black-peg results (Q989451) (← links)
- An optimal strategy for static black-peg mastermind with three pegs (Q1617676) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
- Bounds for the static permutation mastermind game (Q2222951) (← links)
- Playing mastermind with constant-size memory (Q2254508) (← 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)
- 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)
- Optimal schemes for combinatorial query problems with integer feedback (Q6138906) (← links)
- Mastermind with a linear number of queries (Q6632799) (← links)
