Author: Robert Hyatt
Date: 08:22:37 08/21/02
Go up one level in this thread
On August 21, 2002 at 11:02:30, Bas Hamstra wrote: >On August 21, 2002 at 10:45:51, Gian-Carlo Pascutto wrote: > >>On August 21, 2002 at 10:35:13, Vincent Diepeveen wrote: >> >>>2 * sqrt(40)^18 = 524288000000000 nodes needed to search it *minimum*. >> >>That is pure alphabeta. Simple PVS will already reduce this tremendously. >> >>I'm quite sure we already did all the math five times, actually, but >>you keep 'forgetting' the details which don't coincide with your >>point of view. > >I don't think PVS will matter a lot as compared to ab. But *certainly* not >tremendously! > >Bas. All you need to do is compute DB's effective branching factor. I did this for one or two games when the logs first came out. It was just under 4.0. That says something about the tree they are searching as it is well below basic alpha/beta which should be around 6-7...
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.