Phutball is PSPACE-hard

Dariusz Dereniowski
Arxiv ID: 0804.1777Last updated: 3/5/2021
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.

PaperStudio AI Chat

I'm your research assistant! Ask me anything about this paper.
Commercial Disclosure
© 2023 Paper Studio™. All Rights Reserved.