Pages that link to "Item:Q2222951"

The following pages link to Bounds for the static permutation mastermind game (Q2222951):

Displaying 8 items.

• On the algorithmic complexity of the Mastermind game with black-peg results (Q989451) (← links)
• Query complexity of mastermind variants (Q1690229) (← links)
• Bounds for static black-peg AB mastermind (Q1708631) (← 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)
• The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) (Q2285139) (← links)
• Optimal strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)