An algorithmic analysis of the Honey-Bee game (Q714789): Difference between revisions

@@ Property / cites work @@
+Q4407717
@@ Property / cites work: Q4407717 / rank @@
+Normal rank
@@ Property / cites work @@
+TETRIS IS HARD, EVEN TO APPROXIMATE
@@ Property / cites work: TETRIS IS HARD, EVEN TO APPROXIMATE / rank @@
+Normal rank
@@ Property / cites work @@
+Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
+Normal rank
@@ Property / cites work @@
+Computing a perfect strategy for nxn chess requires time exponential in n
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparability graphs and intersection graphs
@@ Property / cites work: Comparability graphs and intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Othello game on an \(n\times n\) board is PSPACE-complete
+Normal rank
@@ Property / cites work @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+More on the complexity of common superstring and supersequence problems
+Normal rank
@@ Property / cites work @@
+Gobang is PSPACE-complete
@@ Property / cites work: Gobang is PSPACE-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Hex ist Pspace-vollständig. (Hex is Pspace-complete)
+Normal rank
@@ Property / cites work @@
+<i>N</i> by <i>N</i> Checkers is Exptime Complete
@@ Property / cites work: <i>N</i> by <i>N</i> Checkers is Exptime Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407697
@@ Property / cites work: Q4407697 / rank @@
+Normal rank