We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins the game. In contrast, the similar problems of determining whether there is an immediately winning move in checkers, or a move that kings a man, are both solvable in polynomial time.
- Pub Date:
- August 2000
- Computer Science - Computational Complexity;
- Computer Science - Computer Science and Game Theory;
- 9 pages, 8 figures. Revised to include additional references on the complexity of checkers