Phutball is PSPACE-hard
Computer Science and Game Theory
2021-03-05 v2 Discrete Mathematics
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.
Cite
@article{arxiv.0804.1777,
title = {Phutball is PSPACE-hard},
author = {Dariusz Dereniowski},
journal= {arXiv preprint arXiv:0804.1777},
year = {2021}
}
Comments
13 pages, 7 figures