| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437708 | Theoretical Computer Science | 2010 | 8 Pages |
Abstract
We consider the n×n 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
