Skip to main content

Signs of Hope and Kaissa

  • Chapter
Kasparov versus Deep Blue
  • 210 Accesses

Abstract

The 1960s were the days of the Cold War between the United States and the former USSR, but as cold as relations were between these two adversaries, there was one area where some friendly cooperation took place. The authors of two chess programs, one in the United States and the other on the other side of the Iron Curtain and both the cream of the thin crop of those days, agreed to hold a friendly four-game match in 1966 with moves communicated across the Atlantic by telegraph.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • A. Kotok, “A Chess Playing Program for the IBM 7090.” B. S. Thesis, MIT, 1962 AI Project Memo 41, Computer Center, MIT, Cambridge, Massachusetts.

    Google Scholar 

  • G. M. Adelson-Velsky, V. L. Arlazarov, A. R. Bitman, A. A. Zhivotovsky, and A. V. Uskov, “Programming a computer to play chess,” Russian Math. Surveys 25, (March-April 1970): 221–62.

    Article  Google Scholar 

  • G. M. Adelson-Velsky, V. L. Arlazarov, and M. V. Donskoy, “Some methods of controlling the tree search in chess programs,” Artificial Intelligence 6, no. 4 (1975): 361–71.

    Article  Google Scholar 

  • G. M. Adelson-Velsky, V L. Arlazarov, and M. V Donskoy, Algorithms for Games. New York: Springer-Verlag, 1988.

    MATH  Google Scholar 

  • M. M. Botvinnik, Computers, Chess and Long Range Planning. Berlin and New York: Springer-Verlag, 1970.

    MATH  Google Scholar 

  • M. M. Botvinnik, Computers in Chess: Solving Inexact Search Problems. New York: Springer-Verlag, 1984.

    MATH  Google Scholar 

  • “U.S. Computer Battling Soviets’ in Chess Game,” New York Times, November 22, 1966, p. 3.

    Google Scholar 

  • R. H. Anderson, “Electronic Chess is Won by Soviet,” New York Times, November 26, 1967.

    Google Scholar 

  • M. V. Donskoy and J. Schaeffer, “Report on the 1st Soviet Computer-Chess Championship or reawakening a sleeping giant,” ICC A Journal 11, no. 2/3 (June/September 1988): 111–16.

    Google Scholar 

  • A. A. Timofeev, “Report on the 1st International Chess-Computer Tournament in the USSR,” ICCA Journal 12, no. 2 (June 1989): 115–16.

    MathSciNet  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Newborn, M. (1997). Signs of Hope and Kaissa . In: Kasparov versus Deep Blue. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2260-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2260-6_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7477-3

  • Online ISBN: 978-1-4612-2260-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics