Skip to main content

Ladders Are PSPACE-Complete

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2063)

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-45579-5_16
  • Chapter length: 9 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-45579-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M., R., Johnson, D., S., Computers and Intractability, Bell Telephone Laboratories, (1979)

    Google Scholar 

  2. Lichtenstein, D. and Sipser, M., GO is Polynomial-Space Hard, Journal of the ACM, Vol. 27, No. 2, (April 1980) 393–401.

    MATH  CrossRef  MathSciNet  Google Scholar 

  3. Robson, J., The Complexity of Go, Proc. IFIP (International Federation of Information Processing), (1983) 413–417.

    Google Scholar 

  4. Robson, J., Combinatorial games with exponential space complete decision problems, Proc. 11th Symposium on Mathematical Foundations of Computer Science, (1984) 498–506.

    Google Scholar 

  5. Robson, J., Alternation with Restrictions on Looping, Information and Control, Vol. 67, 2–11 (1985).

    MATH  MathSciNet  Google Scholar 

  6. Papadimitriou, H., Computational complexity, Addison-Wesley, (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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