CiteSeerX — Phutball Endgames are Hard

Phutball Endgames are Hard (2002)

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Demaine02phutballendgames,
    author = {Erik D. Demaine and Martin L. Demaine and David Eppstein},
    title = {Phutball Endgames are Hard},
    year = {2002}
}

Bookmarks

OpenURL

Abstract:

We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete 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.

Citations

76	Winning Ways for your – Berlekamp, Conway, et al. - 2001
70	Hamilton paths in grid graphs – Itai, Papadimitriou, et al. - 1982
32	The complexity of Go – Robson - 1983
24	Computing a perfect strategy for n × n Chess requires time exponential in n – Fraenkel, Lichtenstein - 1981
19	N by N checkers is EXPTIME complete – Robson - 1984
8	Computing a perfect strategy for n×n Chess requires time exponential in n – Fraenkel, Lichtenstein - 1981
6	The complexity of checkers on an N ×N board — preliminary report – Fraenkel, Garey, et al. - 1978
2	Java program – Fanorona - 1997
2	Philosopher’s Football. Abstract Games no – Williams - 2000
1	Zillions of Games: Phutball – Burke - 1999
1	Resultats du Tournoi Berder99. Web page – Cazenave - 1999
1	Computational Complexity of Games and – Eppstein - 2000
1	Fanorona: History, Rules and Strategy – Fox - 1987
1	The complexity of checkers on an – Fraenkel, Garey, et al. - 1978
1	Uncrossed knight paths is NP-complete – Mazzoni, Watkins - 1997
1	Computational Complexity of Games and Puzzles. Web page, 2000, http://www. ics.uci.edu/ ∼ eppstein/hard.html – Eppstein