The following pages link to (Q4297758):
Displayed 12 items.
- Guessing bank PINs by winning a mastermind game (Q692940) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- The number of pessimistic guesses in Generalized Mastermind (Q987843) (← links)
- Efficient solutions for mastermind using genetic algorithms (Q1000972) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
- An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system (Q2255222) (← 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)
- Strategy optimization for deductive games (Q2371368) (← 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)