• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Havannah and TwixT are PSPACE-complete

Thumbnail
Date
2014
Dewey
Intelligence artificielle
Sujet
connection games
Conference country
JAPAN
Book title
Computers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers
Author
Van den Herik, H.Jaap
Publisher
Springer
Publisher city
Berlin Heidelberg
Year
2014
ISBN
978-3-319-09164-8
URI
https://basepub.dauphine.fr/handle/123456789/13742
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Bonnet, Édouard
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Jamain, Florian
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Saffidine, Abdallah
Type
Communication / Conférence
Item number of pages
257
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.