Author: Uri Blass
Date: 02:34:11 08/31/02
Go up one level in this thread
On August 31, 2002 at 04:51:49, Ralf Elvsén wrote: >On August 30, 2002 at 23:00:30, Andreas Herrmann wrote: > >>On August 30, 2002 at 21:03:25, Uri Blass wrote: >> >>>>> >>>>>I know this :-) >>>>> >>>>>But there is the odd/even issue, so the b-factor can change drastically while >>>>>moving from an odd ply to an even ply, and vice versa. >>>> >>>>I think the best is to calculate an average branching factor from all plys. >>>> >>>>bf[avg] = ( bf[2] + bf[3] + bf[4] ... + bf[n] ) / (n - 1) >>>> >>>>Andreas >>> >>>It is better to use >>>( bf[2] * bf[3] * bf[4] ... * bf[n] )^(1/(n-1)) > >Not if the numbers bf[i] are ratios of the type bf[i] = T[i]/T[i-1] (e.g.) >Then everything will cancel out except for the first and last T[i] I think that this is exactly the idea about branching factor. The question is if I need 1 second to get depth 1 how many seconds I need to get depth n. It is also possible to use the formula (T(n)/T(1))^(1/n-1) Uri
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.