Skip to main content

The Chess Monster Hydra

  • Conference paper

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


With the help of the FPGA technology, the boarder between hard- and software has vanished. It is now possible to develop complex designs and fine grained parallel applications without the long-lasting chip design cycles. Additionally, it has become easier to write coarse grained parallel applications with the help of message passing libraries like MPI. The chess program Hydra is a high level hardware-software co-design application which profits from both worlds. We describe the design philosophy, general architecture and performance of Hydra. The time critical part of the search tree, near the leaves, is explored with the help of fine grain parallelism of FPGA cards. For nodes near the root, the search algorithm runs distributed on a cluster of conventional processors. A nice detail is that the FPGA cards allow the implementation of sophisticated chess knowledge without decreasing the computational speed.

sponsored by: PAL Computer Systems, Abu Dhabi,

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-30117-2_101
  • Chapter length: 6 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   74.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-30117-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Condon, J.H., Thompson, K.: Belle chess hardware. In: Clarke, M.R.B. (ed.) Advances in Computer Chess III, pp. 44–54. Pergamon Press, Oxford (1982)

    Google Scholar 

  2. Feldmann, R., Mysliwietz, M., Monien, B.: Studying overheads in massively parallel min/max-tree evaluation. In: In proc. of SPAA 1994, NY, pp. 94–104 (1994)

    Google Scholar 

  3. Hsu, F.-H.: Ibm’s deep blue chess grandmaster chips. IEEE Micro 19(2), 70–80 (1999)

    CrossRef  Google Scholar 

  4. Hsu, F.-H., Anantharaman, T.S., Campbell, M.S., Nowatzyk, A.: Computers, Chess, and Cognition. ch. 5 Deep Thought, pp. 55–78. Springer, Heidelberg (1990)

    Google Scholar 

  5. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence 6(4), 293–326 (1975)

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. Reinefeld, A.: Spielbaum - Suchverfahren. Springer, Heidelberg (1989)

    MATH  Google Scholar 

  7. Slate, D.J., Atkin, L.R.: Chess 4.5 - the northwestern university chess program. In: Frey, P.W. (ed.) Chess Skill in Man and Machine, pp. 82–118. Springer, Heidelberg (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Donninger, C., Lorenz, U. (2004). The Chess Monster Hydra. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22989-6

  • Online ISBN: 978-3-540-30117-2

  • eBook Packages: Springer Book Archive