Abstract
In the game of Go, the question of whether a ladder—a method of capturing stones-works, is shownto 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M., R., Johnson, D., S., Computers and Intractability, Bell Telephone Laboratories, (1979)
Lichtenstein, D. and Sipser, M., GO is Polynomial-Space Hard, Journal of the ACM, Vol. 27, No. 2, (April 1980) 393–401.
Robson, J., The Complexity of Go, Proc. IFIP (International Federation of Information Processing), (1983) 413–417.
Robson, J., Combinatorial games with exponential space complete decision problems, Proc. 11th Symposium on Mathematical Foundations of Computer Science, (1984) 498–506.
Robson, J., Alternation with Restrictions on Looping, Information and Control, Vol. 67, 2–11 (1985).
Papadimitriou, H., Computational complexity, Addison-Wesley, (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crâşmaru, M., Tromp, J. (2001). Ladders Are PSPACE-Complete. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-45579-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43080-3
Online ISBN: 978-3-540-45579-0
eBook Packages: Springer Book Archive