Havannah and TwixT are PSPACE-complete
Bonnet, Édouard; Jamain, Florian; Saffidine, Abdallah (2014), Havannah and TwixT are PSPACE-complete, in Van den Herik, H.Jaap, Computers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers, Springer : Berlin Heidelberg, p. 257
TypeCommunication / Conférence
Book titleComputers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers
Book authorVan den Herik, H.Jaap
MetadataShow full item record
Abstract (EN)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.
Subjects / Keywordsconnection games
Showing items related by title and author.
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems Bonnet, Édouard; Paschos, Vangelis; Sikora, Florian (2016) Article accepté pour publication ou publié
Bonamy, Marthe; Bonnet, Edouard; Bousquet, Nicolas; Charbit, Pierre; Giannopoulos, Panos; Kim, Eun Jung; Rzążewski, P.; Sikora, Florian; Thomassé, S. (2021) Article accepté pour publication ou publié