Deep Blue

Artificial Intelligence

Volumn 134, Issue 1-2, 2002, Pages 57-83

  Campbell, Murray ^a   Hoane Jr , A Joseph ^b   Hsu, Feng Hsiung ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Sandbridge Technologies   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

Computer chess; Evaluation function; Game tree search; Parallel search; Search extensions; Selective search

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SYSTEMS; DATABASE SYSTEMS; DECISION THEORY; FUNCTION EVALUATION; TREES (MATHEMATICS);

COMPUTER CHESS; GAME TREE SEARCH;

GAME THEORY;

EID: 0036149522     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00129-1     Document Type: Article

References (28)

1. Extension heuristics
2. Singular extensions: Adding selectivity to brute-force searching
3. Experiments with the null move
4. A taxonomy of parallel game-tree search algorithms
5. Knowledge discovery in Deep Blue
6. Belle chess hardware
7. Experiments with the null-move heuristic
8. A two-million moves/s CMOS single-chip chess move generator
9. IBM's Deep Blue chess grandmaster chips
10. Deep thought
11. Are there practical alternatives to alpha-beta in computer chess?
12. An analysis of alpha-beta pruning
13. The SEX algorithm in computer chess
14. An improvement to the scout tree-search algorithm
15. Chess 4.5 - The northwestern university chess program
16. Connectionist learning of expert preferences by comparison training
17. Comparison training of chess evaluation functions
18. Retrograde analysis of certain endgames