Author: Uri Blass
Date: 04:52:41 08/15/03
Go up one level in this thread
On August 15, 2003 at 07:23:04, Andreas Herrmann wrote: >On August 15, 2003 at 01:50:53, Ed Schröder wrote: > >>On August 15, 2003 at 01:04:21, Federico Corigliano wrote: >> >>>What's the formula for calculating the (effective) branching factor in Rebel 12 >>>(DOS)? >>>I'm interesting in add it to my engine. >>> >>>Greetings, >>>Federico >> >> >>Frederico, >> >>The most easiest and fair rule I could think off is to maintain the time of the >>first mainvariation of the current iteration (t1) and the time of the first >>mainvariation of the previous iteration (t2), then the branch factor is: >> >>bf=t1/t2 >> >>My best, >> >>Ed > >The branching factor descibes the average number of child nodes. So the formula >should be >bf = (t1-t2)/t2 >or better >bf = (n1-n2)/n2 > >where >t1 = the total time for iterartion n >t2 = the total time for iterartion n-1 >n1 = the total nodes until iterartion n >n2 = the total nodes until iterartion n-1 > >Andreas No when people use the name branching factor they mean t1/t2(by your definition the best possible branching factor is 0 and not 1). I do not know definitions from book but the important definition is definition that people use and your definition is not what I see used. Uri 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.