Havannah and TwixT are PSPACE-complete

DOI10.1007/978-3-319-09165-5_15zbMath1444.91049WikidataQ55891786 ScholiaQ55891786MaRDI QIDQ2947922

Édouard Bonnet, Florian Jamain, Abdallah Saffidine

Publication date: 29 September 2015

Published in: Computers and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09165-5_15

zbMATH Keywords

complexity; Havannah; connection games; abstract strategy games; TwixT

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91A46: Combinatorial games

91A68: Algorithmic game theory and complexity