The chess monster hydra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3203, Issue , 2004, Pages 927-932

  Donninger, Chrilly ^a   Lorenz, Ulf ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); HARDWARE-SOFTWARE CODESIGN; INTEGRATED CIRCUIT DESIGN; MESSAGE PASSING;

COARSE-GRAINED PARALLELS; COMPUTATIONAL SPEED; DESIGN PHILOSOPHY; FINE GRAIN PARALLELISM; FINE-GRAINED PARALLEL APPLICATION; GENERAL ARCHITECTURES; MESSAGE PASSING LIBRARIES; SEARCH ALGORITHMS;

APPLICATION PROGRAMS;

EID: 84947934822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30117-2_101     Document Type: Conference Paper

References (7)

1. J.H. Condon and K. Thompson. Belle chess hardware. Advances in Computer Chess III, M.R.B. Clarke (Editor), Pergamon Press, pages 44–54, 1982.
2. R. Feldmann, M. Mysliwietz, and B. Monien. Studying overheads in massively parallel min/max-tree evaluation. In proc. of SPAA’94, pages 94–104, NY, 1994.
3. F-H. Hsu. Ibm’s deep blue chess grandmaster chips. IEEE Micro, 19(2):70–80, 1999.
4. F-H. Hsu, T. S. Anantharaman, M.S. Campbell, and A. Nowatzyk. Computers, Chess, and Cognition, chapter 5 Deep Thought, pages 55–78. Springer Verlag, 1990.
5. D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.
6. A. Reinefeld. Spielbaum-Suchverfahren. Springer, 1989.
7. D.J. Slate and L.R. Atkin. Chess 4.5-the northwestern university chess program. Chess Skill in Man and Machine, P.W. Frey (ed), Springer, pages 82–118, 1977.