The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(94)90131-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2088043394
@@ Property / OpenAlex ID: W2088043394 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q29030258
@@ Property / Wikidata QID: Q29030258 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Which Is Complete in Polynomial Space
+Normal rank
@@ Property / cites work @@
+Computing a perfect strategy for nxn chess requires time exponential in n
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+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 @@
+On the complexity of some two-person perfect-information games
+Normal rank