Deep blue

被引:577
作者
Campbell, M [1 ]
Hoane, AJ
Hsu, FH
机构
[1] IBM Corp, Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA
[2] Sandbridge Technol, White Plains, NY 10601 USA
[3] Compaq Comp Corp, Western Res Lab, Palo Alto, CA 94301 USA
关键词
computer chess; game tree search; parallel search; selective search; search extensions; evaluation function;
D O I
10.1016/S0004-3702(01)00129-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep Blue is the chess machine that defeated then-reigning World Chess Champion Garry Kasparov in a six-game match in 1997. There were a number of factors that contributed to this success, including: a single-chip chess search engine, a massively parallel system with multiple levels of parallelism, a strong emphasis on search extensions, a complex evaluation function, and effective use of a Grandmaster game database. This paper describes the Deep Blue system, and gives some of the rationale that went into the design decisions behind Deep Blue. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:57 / 83
页数:27
相关论文
共 26 条
  • [1] SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING
    ANANTHARAMAN, T
    CAMPBELL, M
    HSU, FH
    [J]. ICCA JOURNAL, 1988, 11 (04): : 135 - 143
  • [2] [Anonymous], [No title captured]
  • [3] [Anonymous], 2002, DEEP BLUE
  • [4] [Anonymous], 2000, SCALABLE SEARCH COMP
  • [5] [Anonymous], MACHINES LEARN PLAY
  • [6] [Anonymous], COMPUTERS CHESS COGN
  • [7] [Anonymous], 1990, Computers, chess and cognition
  • [8] Beal D. F., 1989, ADV COMPUTER CHESS, V5, P65
  • [9] A taxonomy of parallel game-tree search algorithms
    Brockington, MG
    [J]. ICCA JOURNAL, 1996, 19 (03): : 162 - 174
  • [10] Knowledge discovery in deep blue
    Campbell, M
    [J]. COMMUNICATIONS OF THE ACM, 1999, 42 (11) : 65 - 67