| Playing with Triangulations (2008) | |||||||||||||||
Abstract | |||||||||||||||
| 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. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||