4.7 Article

Deep blue

期刊

ARTIFICIAL INTELLIGENCE
卷 134, 期 1-2, 页码 57-83

出版社

ELSEVIER
DOI: 10.1016/S0004-3702(01)00129-1

关键词

computer chess; game tree search; parallel search; selective search; search extensions; evaluation function

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据