• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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

Jamain, Florian

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

Related items

Showing items related by title and author.

  • Thumbnail
    On the complexity of trick-taking card games 
    Saffidine, Abdallah; Jamain, Florian; Bonnet, Édouard (2013) Communication / Conférence
  • Thumbnail
    On the Complexity of Connection Games 
    Bonnet, Edouard; Jamain, Florian; Saffidine, Abdallah (2016) Article accepté pour publication ou publié
  • Thumbnail
    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é
  • Thumbnail
    EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs 
    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é
  • Thumbnail
    Complexity of Grundy Coloring and Its Variants 
    Bonnet, Édouard; Foucaud, Florent; Kim, Eun Jung; Sikora, Florian (2015) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo