Author: Keith Evans
Date: 17:34:53 05/20/02
The following paper might be of interest to some of you. I know that there's been a copy of this floating around the net, but here's a reference to the official paper. You can download a copy of the actual paper if you're an AAAI member. I apologize if this is old news. It's hard to keep up with everything mentioned in CCC. Regards, Keith --- From <http://www.elsevier.com/gej-ng/10/10/48/208/27/30/abstract.html> Deep Blue Murray Campbell a * mcam@us.ibm.com , A. Joseph Hoane Jr. b Joe.Hoane@SandbridgeTech.com and Feng-hsiung Hsu c Feng-hsiung.Hsu@compaq.com a IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, USA b Sandbridge Technologies, 1 N. Lexington Avenue, White Plains, NY 10601, USA c Compaq Computer Corporation, Western Research Laboratory, 250 University Avenue, Palo Alto, CA 94301, USA Abstract 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. Keywords: Computer chess; Game tree search; Parallel search; Selective search; Search extensions; Evaluation function *Corresponding author. The ordering of the authors is alphabetic
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.