Tron, a Combinatorial Game on Abstract Graphs

Tillmann Miltzow

Abstract: We study the combinatorial two-player game $\texttt{\rm tron}$ . We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACE- completeness. We prove this conjecture.