Author: David Rasmussen
Date: 11:53:14 01/30/02
Go up one level in this thread
On January 30, 2002 at 14:45:20, Dann Corbit wrote: >> >>But in a normal middlegame situation with a high branching factor, I don't >>believe it, even if you have 200 Mn/s. As far as I understood, DB _did_ pretty >>much blindly search "the whole" (of course they used alpha-beta pruning) tree. > >Why do you understand that? I have talked to Murray Campbell and am very sure >that it is not the case. On what do you base your understanding? > Mainly posts by Hsu in newsgroups. There is a lot of interesting stuff now that google groups have all the old stuff now :) >>They had extensions, but as far as I know, no forward pruning of any kind. I >>might be wrong. > >I don't know what kind of pruning they used. But use it they did. I also know >that the search algorithm changes in some way after 30 seconds. OK, I didn't know that. /David
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.