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

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

Extracted Key Phrases

10 Figures and Tables

Showing 1-4 of 4 references

Fast algorithms for the tron game on trees

  • L Hans, Ton Bodlaender, Kloks
  • 1990
Highly Influential
2 Excerpts

Graph theory, volume 3 of Graduate texts in mathematics

  • R Diestel
  • 2005