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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Aichholzer, O., Bremner, D., Demaine, E. D., Hurtado, F., Kranakis, E., Krasser, H., … Urrutia, J. (2003). Playing with Triangulations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2866, 22–37. https://doi.org/10.1007/978-3-540-44400-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
