Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Deep Blue

Author: Robert Hyatt

Date: 05:39:11 08/02/01

Go up one level in this thread


On August 02, 2001 at 03:44:01, Janosch Zwerensky wrote:

>Hi all,
>
>I read some time ago that Deep Blue wasn't using heuristic game tree pruning
>methods (like, for example, the null-move technique).
>Since null-move was known when DB was around, can anyone here tell why the DB
>team decided not to use it (or wasn't able to do so)?
>
>Regards,
>Janosch.


You can find the explanation by Hsu in several places.  The main point is that
null-move introduces an error into the tree, because it reduces the depth at
certain points, which can hide certain tactics.  Most of us like the overall
result of using null-move, but Hsu did not.  And didn't use it.  There are
others that don't use it today (including commercial microcomputer programs
although many do use it as well).

Hsu wanted to reach significant depth without introducing the particular type
of error that is associated with null-move.



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.