Abstract
In the game of Go, the question of whether a ladder-a method of capturing stones-works, is shown to be PSPACE-complete. Our reduction closely follows that of Lichtenstein and Sipser [2], who first showed PSPACE-hardness of Go by letting the outcome of a game depend on the capture of a large group of stones. A greater simplicity is achieved by avoiding the need for pipes and crossovers.
Cite
CITATION STYLE
APA
Crâşmaru, M., & Tromp, J. (2001). Ladders are PSPACE-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2063, pp. 241–249). Springer Verlag. https://doi.org/10.1007/3-540-45579-5_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free