Skip to main content
SpringerLink
Log in

Belle and High-Speed Chess Circuitry

  • Chapter
Kasparov versus Deep Blue

  • 214 Accesses

Abstract

After completing his work on the UNIX operating system, an incredible accomplishment in itself and sufficient on which to rest one’s laurels, Ken Thompson turned to developing a chess program. Thompson has a tremendous amount of energy, and when he becomes interested in something, exciting things happen. In addition to his work on computers, Thompson had other strong interests, including traveling to the South Pole, restoring antique autos, and, well, flying, about which a story cannot go unrecorded.

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

Access this chapter

Log in via an institution
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

  • J. H. Condon and K. Thompson, “Belle chess hardware,” in Advances in Computer Chess 3, ed. M. R. B. Clarke (Oxford: Pergamon Press, 1982), 45–54.

    Google Scholar 

  • J. H. Condon and K. Thompson, “Belle,” in Chess Skill in Man and Machine, 2nd edition, ed. P. Frey, (Springer-Verlag, 1983), 201–10.

    Google Scholar 

  • T. Ströhlein, “Untersuchungen über kombinatorische Spiele,” Dissertation, Fakultät für Allgemaine Wissenschaften der Technischen Hochschule München, 1970.

    Google Scholar 

  • D. E. Knuth, The Art of Computer Programming 1, Fundamental Algorithms, 2nd ed., (Addison-Wesley, 1975). [See pages 270 and 546 for a discussion on retrograde analysis.]

    Google Scholar 

  • M. R. B. Clarke, “A quantitative study of king and pawn against king,” Advances in Computer Chess 1, ed. M. R. B. Clarke (Edinburgh University Press, 1977): 108–118.

    Google Scholar 

  • M. A. Bramer, “Computer-generated databases for the endgame in chess,” Mathematics Faculty Technical Report, The Open University (1978).

    Google Scholar 

  • V. L. Arlazarov and A. L. Futer, “Computer analysis of a rook endgame,” Machine Intelligence 9, eds. J. E. Hayes, D. Michie, and L. J. Mikulich (Ellis Horwood Limited, Chichester, England, 1984): 361–371.

    Google Scholar 

  • J. Roycroft, “A proposed revision of the ‘50-move rule’,” ICCA Journal 7, no. 3 (September 1984): 164–170.

    Google Scholar 

  • H. J. van den Herik and I. S. Herschberg, “The construction of an omniscient endgame data base,” ICCA Journal 8, no. 2 (June 1985): 66–87.

    Google Scholar 

  • H. J. van den Herik and I. S. Herschberg, “Elementary theory improved, a conjecture refuted,” ICCA Journal 8, no. 3 (September 1985): 141–149.

    Google Scholar 

  • Ard van Bergen, “An ultimate look at the KPK data base,” ICCA Journal 8, no. 4 (December 1985): 216–218.

    Google Scholar 

  • H. J. J. Nerikens, “Constructing databases to fit a microcomputer,” ICCA Journal 8, no. 4 (December 1985): 219–224.

    Google Scholar 

  • I. S. Herschberg and H. J. van den Herik, “A gauge of endgames,” ICCA Journal 8, no. 4 (December 1985): 225–229.

    Google Scholar 

  • H. J. van den Herik and I. S. Herschberg, “A data base on databases,” ICCA Journal 9, no. 1 (March 1986): 29–34.

    Google Scholar 

  • A. van Bergen and T. van der Storm, “The KPK endgame: a unit correction,” ICCA Journal 9, no. 1 (March 1986): 35–36.

    Google Scholar 

  • I. S. Herschberg and H. J. van den Herik, “Thompson’s new data-base results,” ICCA Journal 9, no. 1 (March 1986): 45–49.

    Google Scholar 

  • K. Thompson, “Retrograde analysis of certain endgames,” ICCA Journal 9, no. 3, (September 1986): 131–139.

    Google Scholar 

  • E. A. Komissarchik and A. L. Futer, “Computer analysis of a queen endgame,” ICCA Journal 9, no. 4 (1986): 189–199.

    Google Scholar 

  • H. J. van den Herik and I. S. Herschberg, “The KBBKN statistics: new data from Ken Thompson,” ICCA Journal 10, no. 1 (March 1987): 39–40.

    Google Scholar 

  • S. T. Dekker, H. J. van den Herik, and I. S. Herschberg, “Complexity starts at five,” ICCA Journal 10, no. 3 (September 1987): 125–138.

    Google Scholar 

  • H. J. van den Herik, I. S. Herschberg, and N. Nakad, “A six-men-endgame database: KRP(a2)KbBP(a3),” ICCA Journal 10, no. 4 (December 1987): 163–180.

    Google Scholar 

  • L. Rasmussen, “Ultimates in KQKR and KRKN,” ICCA Journal 11, no. 1 (March 1988): 21–25.

    MathSciNet  Google Scholar 

  • R. Sattler, “Further to the KRP(a2)KbBP(a3),” ICCA Journal 11, no. 2/3 (June/September 1988): 82–87.

    Google Scholar 

  • H. J. van den Herik, I. S. Herschberg, and N. Nakad, “A reply to R. Sattler’s remarks on the KRP(a2)KbBP(a3) database,” ICCA Journal 11, no. 2/3 (June/September 1988): 88–91.

    Google Scholar 

  • L. Rasmussen, “A database for KRKP,” ICCA Journal 11, no. 4 (December 1988): 144–150.

    Google Scholar 

  • D. Forthoffer, L. Rasmussen, and S. Dekker, “A correction to some KRKB-database results,” ICCA Journal 12, no. 1 (March 1989): 25–27.

    Google Scholar 

  • L. Stiller, “Parallel analysis of certain endgames,” ICCA Journal 12, no. 3 (June 1989): 55–64.

    Google Scholar 

  • H. Zellner, “The KPK database revisited,” ICCA Journal 12, no. 2 (June 1989): 78–82.

    MathSciNet  Google Scholar 

  • K. Thompson, “KQPKQ and KRPKR endings,” ICCA Journal 13, no. 4 (December 1990): 196–199.

    Google Scholar 

  • K. Thompson, “New results for KNPKB and KNPKN,” ICCA Journal 14, no. 1 (March 1991): 17.

    Google Scholar 

  • L. Stiller, “Some results from a massively parallel retrograde analysis,” ICCA Journal 14, no. 3 (September 1991): 129–134.

    Google Scholar 

  • L. Stiller, “KQNKRR,” ICCA Journal 15, no. 1 (March 1992): 16–18.

    MathSciNet  Google Scholar 

  • The Editors, “Thompson: all about five men,” ICCA Journal 15, no. 3 (September 1992): 140–143.

    Google Scholar 

  • I. S. Herschberg and H. J. van den Herik, “Back to fifty,” ICCA Journal 16, no. 1 (March 1993): 1–2.

    Google Scholar 

  • The Editors, “Thompson: quintets with variations,” ICCA Journal 16, no. 2 (June 1993): 86–90.

    Google Scholar 

  • S. J. Edwards and the Editorial Board, “An examination of the endgame KBNKN,” ICCA Journal 18, no. 3 (September 1995): 160–167.

    Google Scholar 

  • S. J. Edwards, “An examination of the endgame KBBKN,” ICCA Journal 19, no. 1 (March 1996): 24–32.

    Google Scholar 

  • K. Thompson, “Computer chess strength,” Advances in Computer Chess 3, ed. M. R. B. Clarke (Oxford: Pergamon Press, 1982), 55–56.

    Google Scholar 

  • M. Newborn, “Computer chess: recent progress and future expectations,” Proc. Jerusalem Conference on Information Technology (North-Holland, 1978): 189–92.

    Google Scholar 

  • M. Newborn, “A hypothesis concerning the strength of chess programs,” JCCA Journal 8, no. 4 (December 1985): 209–15.

    Google Scholar 

Download references

Authors
  1. Monty Newborn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Newborn, M. (1997). Belle and High-Speed Chess Circuitry. In: Kasparov versus Deep Blue. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2260-6_6

Download citation

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

  • 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

Search

Navigation