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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have