Corpus ID: 2978262

Phutball Endgames are Hard

@article{Demaine2000PhutballEA,
  title={Phutball Endgames are Hard},
  author={E. Demaine and Martin L. Demaine and D. Eppstein},
  journal={ArXiv},
  year={2000},
  volume={cs.CC/0008025}
}

E. Demaine, Martin L. Demaine, D. Eppstein

Published 2000

Mathematics, Computer Science

ArXiv

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

We show that, in John Conway’s board game Phutball (or Philosopher’s Football), it is NPcomplete to determine whether the current player has a move that immediately wins the game. In contrast, the similar problems of determining whether there is an immediately winning move in checkers, or a move that kings a man, are both solvable in polynomial time.