Skip to main content
SpringerLink
Log in

Playing with Triangulations

  • Conference paper
Discrete and Computational Geometry (JCDCG 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2866))

Included in the following conference series:

  • 640 Accesses

Abstract

We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games: constructing, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy. Along the way, we show connections to existing combinatorial games such as Kayles.

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. Aichholzer, O., Bremner, D., Demaine, E.D., Hurtado, F., Kranakis, E., Krasser, H., Ramaswami, S., Sethia, S., Urrutia, J.: Games on Triangulations: Several Variations (manuscript in preparation)

    Google Scholar 

  2. Berlekamp, E.R.: The Dots and Boxes Game: Sophisticated Child’s Play. Academic Press, London (1982)

    Google Scholar 

  3. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for your Mathematical Plays. Academic Press, London (1982); Second edition in print, A K Peters Ltd. (2001)

    MATH  Google Scholar 

  4. Boedlander, H.L., Kratsch, D.: Kayles and Nimbers. J. of Algorithms 43, 106–119 (2002)

    Article  Google Scholar 

  5. Conway, J.H.: On Numbers and Games. Academic Press, London (1976); Second edition, A K Peters Ltd. (2002)

    MATH  Google Scholar 

  6. Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10, 399–430 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18–32. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Fraenkel, S.: Combinatorial Games: Selected Bibliography with a Succinct Gourmet Introduction. Electronic Journal of Combinatorics, http://www.wisdom.weizmann.ac.il/~fraenkel

  9. Galtier, J., Hurtado, F., Noy, M., Pérennes, S., Urrutia, J.: Simultaneous edge flipping in triangulations (submitted)

    Google Scholar 

  10. Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16, 185–225 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IICM – Softwaretechnology, Graz University of Technology, Inffeldgasse 16b/I, A-8010, Graz, Austria

    Oswin Aichholzer

  2. Faculty of Computer Science, University of New Brunswick, P.O. Box 4400, Fredericton, NB, E3B 5A3, Canada

    David Bremner

  3. Laboratory for Computer Science, Massachusetts Institute of Technology, 200 Technology Square, Cambridge, MA, 02139, USA

    Erik D. Demaine

  4. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo,5, 08028, Barcelona, Spain

    Ferran Hurtado

  5. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada

    Evangelos Kranakis

  6. Institute for Theoretical Computer Science, Graz University of Technology, Inffeldgasse 16b/I, A-8010, Graz, Austria

    Hannes Krasser

  7. Computer Science Department, Rutgers University, 321 Business & Science Building, Camden, NJ, 08102, USA

    Suneeta Ramaswami

  8. Department of Computer Science, Oregon State University, Corvallis, OR, 97331-3202, USA

    Saurabh Sethia

  9. Instituto de Matemáticas, Universidad Nacional Autónoma de México, Área inv. científ., Circ. Ext., Ciudad Univ., Coyoacán, 04510, México, D.F., México

    Jorge Urrutia

Authors
  1. Oswin Aichholzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Bremner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ferran Hurtado
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Evangelos Kranakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Hannes Krasser
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Suneeta Ramaswami
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Saurabh Sethia
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Jorge Urrutia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku Tokio, Japan

    Jin Akiyama

  2. Ibaraki University, Nakanarusawa, Hitachi, 316-8511, Ibaraki, Japan

    Mikio Kano

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aichholzer, O. et al. (2003). Playing with Triangulations. In: Akiyama, J., Kano, M. (eds) Discrete and Computational Geometry. JCDCG 2002. Lecture Notes in Computer Science, vol 2866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44400-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44400-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20776-4

  • Online ISBN: 978-3-540-44400-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation