Pages that link to "Item:Q2341748"
From MaRDI portal
The following pages link to The worst case number of questions in generalized AB game with and without white-peg answers (Q2341748):
Displayed 6 items.
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- Bounds for the static permutation mastermind game (Q2222951) (← 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)