Author: Dann Corbit
Date: 12:33:20 01/30/02
Go up one level in this thread
On January 30, 2002 at 15:26:46, Uri Blass wrote: >On January 30, 2002 at 14:56:00, Dann Corbit wrote: > >>On January 30, 2002 at 14:47:42, Uri Blass wrote: >>[snip] >>>Yes but I understood that Deeper blue did not use pruning except maybe qsearch >>>and most of the nodes in the tree are not qsearch nodes. >> >>On whose testimony do you base this assumption? > >I based my assumption on the knowledge that Hsu was against pruning and he never >published information about other ways of pruning when there is information >about singular extensions and even extensions when there are only 2 good moves. If Hsu said that they did not prune, then it is possible I misunderstood what Murray Campbell was saying. The discussions were not terribly technical and I may have been reading between the lines. On the other hand, I also have heard the explanation of the logs in the same way that Robert had. So, I don't have any possible explanations. Maybe they used a random number generator to fill out the depth numbers. ;-)
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.