Abstract
Numerous popular abstract strategy games ranging from Hex and Havannah via TwixT and Slither to Lines of Action belong to the class of connection games. Still, very few complexity results on such games have been obtained since Hex was proved pspace-complete in the early 1980s. We study the complexity of two connection games among the most widely played ones, i.e., we prove that Havannah and TwixT are pspace-complete. The proof for Havannah involves a reduction from Generalized Geography and is based solely on ring-threats to represent the input graph. The reduction for TwixT builds up on previous work as it is a straightforward encoding of Hex. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Bonnet, É., Jamain, F., & Saffidine, A. (2014). Havannah and TwixT are PSPACE-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8427 LNCS, pp. 175–186). Springer Verlag. https://doi.org/10.1007/978-3-319-09165-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
