A PSPACE-complete Graph Nim

Details A PSPACE-complete Graph Nim A PSPACE-complete Graph Nim

2011-01-07

arxiv.org/abs/1101.1507v2

Computer Science

Computer Science and Game Theory

Scientific paper

We build off the game, NimG to create a version named Neighboring Nim. By reducing from Geography, we show that this game is PSPACE-hard. The games created by the reduction share strong similarities with Undirected (Vertex) Geography and regular Nim, both of which are in P. We show how to construct PSPACE-complete versions with nim heaps *1 and *2. This application of graphs can be used as a form of game sum with any games, not only Nim.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484533