Phutball is PSPACE-hard

  title={Phutball is PSPACE-hard},
  author={Dariusz Dereniowski},

Figures from this paper

Edge Hop: A Framework to Show NP-Hardness of Combinatorial Games
  • Moritz Gobbert
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2018
It is shown that the decision question whether the marked token can reach the goal node is NP-complete and several gadgets are constructed to show a reduction via Directed Hamiltonian cycles.


The Othello game on an n*n board is PSPACE-complete
Phutball Endgames are Hard
It is shown that, in John Conway’s board game Phutball, it is NPcomplete to determine whether the current player has a move that immediately wins the game.
GO Is Polynomial-Space Hard
It is proved that GO is Pspace hard by reducing a Pspace-complete set, TQBF, to a game called generalized geography, then to a planar version of that game, and finally to GO.
The complexity of checkers on an N × N board
Under certain reasonable assumptions about the "drawing rule" in force, the problem of whether a specified player can force a win against best play by his opponent is shown to be PSPACE-hard.
Generalized Amazons is PSPACE-Complete
This paper presents two proofs for the PSPACE-completeness of the generalized version of the full game Amazons, a perfect information board game with simple rules and large branching factors.
Rush Hour is PSPACE-complete
In this report we give a formal definition of the sliding block puzzle Rush Hour and we report on the proof showing that Rush Hour is PSPACE-complete from “The nondeterministic constraint logic model
One-Dimensional Phutball
The case of a restricted version of one-dimensional phutball called Oddish Phutball is solved by presenting an explicit strategy in terms of a potential function.
A Combinatorial Problem Which Is Complete in Polynomial Space
It is shown that determining who wins such a game if each player plays perfectly is very hard; this result suggests that the theory of combinational games is difficult.
N by N Checkers is Exptime Complete
  • J. Robson
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1984
The question of whether a particular player can force a win from a given position and also the question of what is the best move in agiven position are considered.
The complexity of Dyson Telescopes puzzle
In this paper, we give a PSPACE-completeness reduction from QBF to the Dyson Telescopes Puzzle where opposing telescopes can overlap in at least two spaces. The reduction does not use tail ends of