Tron, a combinatorial Game on abstract Graphs
Tillmann Miltzow
TL;DR
This paper investigates the combinatorial game Tron on various graphs, proving its PSPACE-completeness and analyzing extremal properties across different graph classes.
Contribution
It confirms Bodlaender and Kloks' conjecture that Tron is PSPACE-complete and explores extremal questions on general and specific graph classes.
Findings
Proves Tron is PSPACE-complete.
Provides extremal results for Tron on various graphs.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Artificial Intelligence in Games · Graph Labeling and Dimension Problems