An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs (Q2958353): Difference between revisions

@@ Property / cites work @@
+Mastermind
@@ Property / cites work: Mastermind / rank @@
+Normal rank
@@ Property / cites work @@
+Playing Mastermind With Many Colors
@@ Property / cites work: Playing Mastermind With Many Colors / rank @@
+Normal rank
@@ Property / cites work @@
+Playing mastermind with constant-size memory
@@ Property / cites work: Playing mastermind with constant-size memory / rank @@
+Normal rank
@@ Property / cites work @@
+Guessing bank PINs by winning a mastermind game
@@ Property / cites work: Guessing bank PINs by winning a mastermind game / rank @@
+Normal rank
@@ Property / cites work @@
+Q4457558
@@ Property / cites work: Q4457558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4660333
@@ Property / cites work: Q4660333 / rank @@
+Normal rank
@@ Property / cites work @@
+On the algorithmic complexity of the Mastermind game with black-peg results
+Normal rank
@@ Property / cites work @@
+The number of pessimistic guesses in Generalized Mastermind
+Normal rank
@@ Property / cites work @@
+The number of pessimistic guesses in generalized black-peg mastermind
+Normal rank
@@ Property / cites work @@
+Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
+Normal rank
@@ Property / cites work @@
+The worst case number of questions in generalized AB game with and without white-peg answers
+Normal rank
@@ Property / cites work @@
+Bounding memory for Mastermind might not make it harder
+Normal rank
@@ Property / cites work @@
+Q4297758
@@ Property / cites work: Q4297758 / rank @@
+Normal rank