Pages that link to "Item:Q1708631"

The following pages link to Bounds for static black-peg AB mastermind (Q1708631):

Displaying 7 items.

• An optimal strategy for static black-peg mastermind with three pegs (Q1617676) (← links)
• On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
• The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
• Bounds for the static permutation mastermind game (Q2222951) (← links)
• The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) (Q2285139) (← links)
• The worst case number of questions in generalized AB game with and without white-peg answers (Q2341748) (← links)
• Optimal strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)