Pages that link to "Item:Q2221264"
From MaRDI portal
The following pages link to The exact query complexity of yes-no permutation mastermind (Q2221264):
Displaying 6 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)
- Bounds for the static permutation mastermind game (Q2222951) (← links)
- (Q5875452) (← links)