Combinatorial Game Complexity: An Introduction with Poset Games
Computational Complexity
2015-06-26 v2
Abstract
Poset games have been the object of mathematical study for over a century, but little has been written on the computational complexity of determining important properties of these games. In this introduction we develop the fundamentals of combinatorial game theory and focus for the most part on poset games, of which Nim is perhaps the best-known example. We present the complexity results known to date, some discovered very recently.
Keywords
Cite
@article{arxiv.1505.07416,
title = {Combinatorial Game Complexity: An Introduction with Poset Games},
author = {Stephen A. Fenner and John Rogers},
journal= {arXiv preprint arXiv:1505.07416},
year = {2015}
}
Comments
48 pages, 8 figures. This is the extended version of an article appearing in the Bulletin of the EATCS, 2015. New results (Lemma 2.21 and Proposition 2.30) and reference added