2000 character limit reached
A PSPACE-complete Graph Nim (1101.1507v3)
Published 7 Jan 2011 in cs.GT, cs.CC, and math.CO
Abstract: 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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.