Ladders are PSPACE-complete

DOI10.1007/3-540-45579-5_16MaRDI QIDQ4536692zbMATH OpenFDO

Authors Marcel Crasmaru, John Tromp

Publication date 28 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45579-5_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

Recommendations

• scientific article; zbMATH DE number 1944394
• The Othello game on an \(n\times n\) board is PSPACE-complete
• Phutball is PSPACE-hard
• PSPACE-Hardness of some combinatorial games
• \textsf{PSPACE}-complete two-color planar placement games

Cited in

(3)

• The Go polynomials of a graph.
• scientific article; zbMATH DE number 1944394 (Why is no real title available?)
• \textsf{PSPACE}-completeness of \(k\)-\textsc{Atropos}

This page was built for publication: Ladders are PSPACE-complete

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