Playing with Triangulations
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.
KeywordsOpen Triangle Boundary Edge Winning Strategy Greedy Strategy Identical Triangulation
Unable to display preview. Download preview PDF.
- 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
- 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