Skip to main content
SpringerLink
Log in

\(\texttt{\rm Tron}\), a Combinatorial Game on Abstract Graphs

  • Conference paper
Fun with Algorithms (FUN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7288))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bodlaender, H.L.: Complexity of path-forming games. Theor. Comput. Sci. 110(1), 215–245 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bodlaender, H.L., Kloks, T.: Fast algorithms for the tron game on trees. Technical report, Utrecht University, Department of Computer Science (1990)

    Google Scholar 

  3. Lisberger, S.: Tron. Disney (1982)

    Google Scholar 

  4. Sipser, M.: Introduction to the theory of computation, vol. 2. PWS Publishing Company (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Freie Universität Berlin, Germany

    Tillmann Miltzow

Authors
  1. Tillmann Miltzow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Col. By Dr., K1S 5B6, Ottawa, ON, Canada

    Evangelos Kranakis

  2. Department of Mathematics and Computer Science, Wesleyan University, 06459, Middleton, CT, USA

    Danny Krizanc

  3. Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Via Torino 155, 30172, Mestre (Ve), Italy

    Flaminia Luccio

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miltzow, T. (2012). \(\texttt{\rm Tron}\), a Combinatorial Game on Abstract Graphs. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30347-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30346-3

  • Online ISBN: 978-3-642-30347-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation