Pages that link to "Item:Q3177818"
From MaRDI portal
The following pages link to Playing Mastermind With Many Colors (Q3177818):
Displayed 13 items.
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← 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)
- The Query Complexity of Finding a Hidden Permutation (Q2848962) (← 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)
- Item:Q3177818 (redirect page) (← links)
- (Q5875452) (← links)