Author: Dave Gomboc
Date: 21:56:41 12/22/98
Go up one level in this thread
On December 22, 1998 at 15:15:29, José de Jesús García Ruvalcaba wrote: > Well, I tried to say exactly the opposite of what you think I think. >Perhaps we have a language problem, I am not a native English speaker. Let me >restate my point: while algorithms have improved, they have also adapted to >faster hardware. [snip] This is a very important point, if I may go off on a tangent. I've heard some comments from people to the effect that "if other people had the hardware that the Deep Blue team did, they wouldn't be searching everything and extending like they do now, instead they'd be using null move with r=2 just like the rest of us". But you know, it's not exactly difficult to implement null-move, it's been done many times before, and though the Deep Blue team consists of a bunch of pretty bright people, it was their choice to do things differently. I think it'd be fairly easy for them to test out a null-move implementation, so would they really just ignore it? My opinion is that they probably did give it a try and, at the nodes per second they were searching, found the extra speed not worth the accuracy loss. Comments? Dave Gomboc
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.