On the complexity of connection games

DOI10.1016/j.tcs.2016.06.033zbMath1371.91027arXiv1605.04715MaRDI QIDQ307770

Édouard Bonnet, Florian Jamain, Abdallah Saffidine

Publication date: 5 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.04715

zbMATH Keywords

complexity; Hex; PSPACE; Havannah; Slither; Twixt

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

91A46: Combinatorial games