Thumbnail - Request a copy

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

Type
Communication / Conférence
Date
2014
Conference country
JAPAN
Book title
Computers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers
Book author
Van den Herik, H.Jaap
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-319-09164-8
Pages
257
Metadata
Show full item record
Author(s)
Bonnet, Édouard cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Jamain, Florian
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Saffidine, Abdallah
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 / Keywords
connection games