Tron, a combinatorial Game on abstract Graphs
Computational Complexity
2011-10-17 v1 Discrete Mathematics
Computer Science and Game Theory
Combinatorics
Abstract
We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACE- completeness. We proof this conjecture.
Cite
@article{arxiv.1110.3211,
title = {Tron, a combinatorial Game on abstract Graphs},
author = {Tillmann Miltzow},
journal= {arXiv preprint arXiv:1110.3211},
year = {2011}
}