Pages that link to "Item:Q987843"
From MaRDI portal
The following pages link to The number of pessimistic guesses in Generalized Mastermind (Q987843):
Displaying 9 items.
- Guessing bank PINs by winning a mastermind game (Q692940) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
- Bounds for the static permutation mastermind game (Q2222951) (← 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 strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)