Cray Blitz and Hitech: Parallel Search and Parallel Eualuation

  • Monty Newborn


In 1975, Robert Hyatt was an undergraduate at the University of Southern Mississippi when he began work on Blitz. Early on, he teamed up with Bert Gower, a fellow member of the USM Chess Club and a professor of music at the university; Gower worked primarily on book openings. The program slowly improved during the late 1970s and by 1979 had earned a USCF rating of 1690. The next year, Hyatt had the opportunity to install his program on a Cray-1 computer, renaming the program Cray Blitz. At the 1980 ACM championship, a special speed-chess tournament was held, and Cray Blitz captured first place, going undefeated in nine games. This gave notice to the computer chess community that Cray Blitz was going to be a serious contender in the coming years. In 1982, Harry Nelson, a Cray assembly language specialist joined the team and helped optimize the code; the program went on to finish equal in points with the winning program Belle at that year’s ACM championship. It was awarded second place based on tie-break points.


Tree Decomposition Very Large Scale Integrate Game Tree Parallel Search World Championship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. R. M. Hyatt, “Cray Blitz: A Computer Chess Playing Program” (M. Sc. thesis, University of Southern Mississippi, Hattiesburg, 1983).Google Scholar
  2. R. M. Hyatt, “Using time wisely,” ICCA Journal 7, no. 1 (March 1984): 4–9.Google Scholar
  3. R. M. Hyatt, “Cray Blitz versus David Levy,” ICCA Journal 7, no. 2 (June 1984): 102–5 [Levy’s version of the match appears on pages 106–17.]Google Scholar
  4. H. L. Nelson, “Hash tables in Cray Blitz,” ICCA Journal 8, no. 1 (March 1985): 3–13.Google Scholar
  5. R. M. Hyatt, “Parallel search on the Cray XMP/48,” ICCA Journal 8, no. 2 (June 1985): 90–99.Google Scholar
  6. R. M. Hyatt, B. E. Gower, and H. L. Nelson, “Cray Blitz,” Advances in Computer Chess 4, ed. D. Beai (Oxford: Pergamon Press, 1985), 8–18.Google Scholar
  7. H. L. Nelson and R. M. Hyatt, “The draw heuristic of Cray Blitz,” ICCA Journal 11, no. 1 (March 1988): 3–9.Google Scholar
  8. R. M. Hyatt, “A High-Performance Parallel Algorithm to Search Depth-First Game Trees,” (Ph.D. thesis, Department of Computer Science, University of Alabama, Birmingham, 1988).Google Scholar
  9. R. M. Hyatt, B. W. Suter, and H. L. Nelson, “A parallel alpha-beta tree searching algorithm,” Parallel Computing 10, no. 3 (1989): 299–308.MATHCrossRefGoogle Scholar
  10. C. Ebeling and A. Palay, “The design and implementation of a VLSI move generator,” IEEE 11th Annual International Symposium on Computer Architecture (Ann Arbor, 1984): 74–80.Google Scholar
  11. H. J. Berliner, “The 1985 Fredkin competition,” ICCA Journal 8, no. 4 (December 1985): 253–259.Google Scholar
  12. H. J. Berliner, “Hitech wins North American Computer-Chess Championship,” ICCA Journal 8, no. 4 (December 1985): 146–147.Google Scholar
  13. H. J. Berliner, “Hitech Update,” ICCA Journal 9, no. 2 (June 1986): 111–112.MathSciNetGoogle Scholar
  14. H. J. Berliner and C. Ebeling, “The SUPREM architecture: a new intelligent paradigm,” Artificial Intelligence 28 (1986): 3–8.CrossRefGoogle Scholar
  15. H. J. Berliner, “Computer chess at Carnegie Mellon University,” Advances in Computer Chess 4, ed. D. Beai (Oxford: Pergamon Press, 1986), 166–180.Google Scholar
  16. H. J. Berliner, “Some innovations introduced by Hitech,” ICCA Journal 10, no. 3 (September 1987): 111–117.Google Scholar
  17. H. J. Berliner, “Hitech wins Pennsylvania State Chess-Championship Tourney,” ICCA Journal 10, no. 3 (September 1987): 155–156.Google Scholar
  18. H. J. Berliner, “A new Hitech computer chess success,” ICCA Journal 11, no. 2/3 (June/September 1988): 24.Google Scholar
  19. H. J. Berliner, “Hitech again wins Pennsylvania Chess Championship: becomes first Senior Master,” ICCA Journal 11, no. 2/3 (June/September 1988): 125–126.Google Scholar
  20. S. G. Akl, D. T. Barnard, and R. J. Doran, “Design, analysis, and implementation of a parallel tree search algorithm,” IEEE Transactions on Pattern Analysis and Machine Intelligence 4, no. 2 (1982): 192–203.MATHCrossRefGoogle Scholar
  21. T. A. Marsland and M. S. Campbell, “Parallel search of strongly ordered game trees,” ACM Computing Surveys 14, no. 4 (1982): 533–551.CrossRefGoogle Scholar
  22. M. Newborn, “A parallel search chess program,” Proc. of the 1985 ACM Annual Conference (1985): 272–277.Google Scholar
  23. T. A. Marsland, M. Olafsson, and J. Schaeffer, “Multiprocessor tree-search experiments,” Advances in Computer Chess 4, ed. D. E Beal (Oxford: Pergamon Press, 1985), 37–51.Google Scholar
  24. T. A. Marsland and E Popowich, “Parallel game-tree search,” IEEE Transactions on Pattern Analysis and Machine Intelligence 7 (1985): 442–452.CrossRefGoogle Scholar
  25. J. Schaeffer, “Improved parallel alpha-beta search,” 1986 Proc. of the FJCC (1986): 519–527.Google Scholar
  26. M. Newborn, “Unsynchronized iteratively deepening parallel alpha-beta search,” IEEE Transactions on Pattern Analysis and Machine Intelligence 10, no. 5 (1988): 687–694.MATHCrossRefGoogle Scholar
  27. E-h. Hsu, “Large-Scale Parallelization of Alpha-Beta Search: An Algorithmic and Architectural Study with Computer Chess,” Technical Report CMU-CS-90-108, Computer Science Department, Carnegie Mellon University, Pittsburgh, Pa., 1990.Google Scholar
  28. R. Feldmann, P. Mysliwietz, and B. Monien, “Game tree search on a massively parallel system,” Advances in Computer Chess 7, eds. H. J. van den Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk (Maastricht, the Netherlands, University of Limburg, 1993): 203–19.Google Scholar
  29. B. C. Kuszmaul, “The Star Tech massively-parallel chess program,” ICCA Journal 18, no. 1 (March 1995): 3–19.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1997

Authors and Affiliations

  • Monty Newborn

There are no affiliations available

Personalised recommendations