The Othello game on an n × n board is PSPACE-complete
Theoretical Computer Science
A Combinatorial Problem Which Is Complete in Polynomial Space
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Rush Hour is PSAPCE-complete, or "Why you should generously tip parking lot attendants"
Theoretical Computer Science
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Admissible Moves in Two-Player Games
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Loopy games and computation
Games, puzzles, and computation
Games, puzzles, and computation
The complexity of checkers on an N × N board
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Generalized amazons is PSPACE-complete
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
| Hi-index | 5.23 |
We consider the nxn game of Phutball. It is shown that, given an arbitrary position of stones on the board, it is a PSPACE-hard problem to determine whether the specified player can win the game, regardless of the opponent's choices made during the game.