Tron, a combinatorial Game on abstract Graphs
arXiv:1110.3211
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.