Tron, a combinatorial game on abstract graphs

Authors:
Tillmann Miltzow
Affiliations:
Institute of Computer Science, Freie Universität Berlin, Germany
Venue:
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Year:
2012

Citing 2
Cited 1

Complexity of path-forming games

Theoretical Computer Science
Introduction to the Theory of Computation

Introduction to the Theory of Computation

Gaming is a hard job, but someone has to do it!

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.