Pages that link to "Item:Q1651863"

The following pages link to On the query complexity of black-peg AB-mastermind (Q1651863):

Displaying 12 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)
• The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← 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)
• (Q5875452) (← links)
• Playing Mastermind with Wordle-like Feedback (Q6551248) (← links)
• Optimal strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)