Pages that link to "Item:Q989451"

The following pages link to On the algorithmic complexity of the Mastermind game with black-peg results (Q989451):

Displaying 15 items.

• Ranking-based black-box complexity (Q528852) (← links)
• 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)
• The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
• The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
• Playing mastermind with constant-size memory (Q2254508) (← 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)
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
• Optimal schemes for combinatorial query problems with integer feedback (Q6138906) (← links)
• Mastermind with a linear number of queries (Q6632799) (← links)