Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Creating Difficult Instances of the Post Correspondence Problem
CG '00 Revised Papers from the Second International Conference on Computers and Games
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the game of Checkers generalized to an N 脳 N board. Although certain properties of positions are efficiently computable (e.g., can Black jump all of White's pieces in a single move?), the general question, given a position, of whether a specified player can force a win against best play by his opponent, is shown to be PSPACE-hard. Under certain reasonable assumptions about the "drawing rule" in force, the problem is itself in PSPACE and hence is PSPACE-complete.