The computational complexity of forced capture Hnefatafl

DOI10.1016/J.TCS.2024.114627MaRDI QIDQ6562456zbMATH OpenFDO

Authors Kyle Burke, Craig Tennenhouse

Publication date 26 June 2024

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

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114627

zbMATH Keywords

combinatorial gamescomputational complexityHnefataflPSPACE

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Amazons, Konane, and cross purposes are PSPACE-complete
• Game values and computational complexity: an analysis via black-white combinatorial games
• Games, puzzles, and computation
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• On the complexity of some two-person perfect-information games
• The game of blocking pebbles
• The Othello game on an \(n\times n\) board is PSPACE-complete
• The Voronoi game on graphs and its complexity
• Winning ways for your mathematical plays. Vol. 1.

Cited in

(1)

• The King chasing problem in Chinese Chess is NP-hard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562456)