The computational complexity of forced capture Hnefatafl

DOI10.1016/j.tcs.2024.114627MaRDI QIDQ6562456

Craig Tennenhouse, Kyle Burke

Publication date: 26 June 2024

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

zbMATH Keywords

computational complexitycombinatorial gamesPSPACEHnefatafl

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• On the complexity of some two-person perfect-information games
• The Othello game on an \(n\times n\) board is PSPACE-complete
• Winning ways for your mathematical plays. Vol. 1.
• The Voronoi game on graphs and its complexity
• Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
• The game of blocking pebbles

This page was built for publication: The computational complexity of forced capture Hnefatafl