Phutball Endgames are Hard

Details Phutball Endgames are Hard Phutball Endgames are Hard

2000-08-23

arxiv.org/abs/cs/0008025v2

More Games of No Chance, MSRI Publications 42, 2002, pp. 351-360

Computer Science

Computational Complexity

9 pages, 8 figures. Revised to include additional references on the complexity of checkers

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Phutball Endgames are Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Phutball Endgames are Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phutball Endgames are Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346748