Phutball is PSPACE-hard

Details Phutball is PSPACE-hard Phutball is PSPACE-hard

2008-04-10

arxiv.org/abs/0804.1777v2

Theoretical Computer Science 411 (2010) 3971-3978

Computer Science

Computer Science and Game Theory

13 pages, 7 figures

Scientific paper

10.1016/j.tcs.2010.08.019

We consider the $n\times n$ 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.

Affiliated with

Also associated with

No associations

Rating

Phutball is PSPACE-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 is PSPACE-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phutball is PSPACE-hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-356516