Tron, a combinatorial Game on abstract Graphs


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] PSPACEcompleteness. We proof this conjecture.

DOI: 10.1007/978-3-642-30347-0_29

Extracted Key Phrases

10 Figures and Tables

Cite this paper

@inproceedings{Miltzow2012TronAC, title={Tron, a combinatorial Game on abstract Graphs}, author={Tillmann Miltzow}, booktitle={FUN}, year={2012} }