
TL;DR
This paper proves that determining the winner in the game of Phutball from any given position is a PSPACE-hard problem, highlighting its computational complexity.
Contribution
It establishes the PSPACE-hardness of Phutball, a significant complexity result for this combinatorial game.
Findings
Determining the winner in Phutball is PSPACE-hard.
The complexity holds for any arbitrary position.
The result extends understanding of computational difficulty in combinatorial games.
Abstract
We consider the 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
