A PSPACE-complete Graph Nim
Computer Science and Game Theory
2014-10-08 v3 Computational Complexity
Combinatorics
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.
Cite
@article{arxiv.1101.1507,
title = {A PSPACE-complete Graph Nim},
author = {Kyle Burke and Olivia George},
journal= {arXiv preprint arXiv:1101.1507},
year = {2014}
}
Comments
14 pages, 3 figures