Author: Larry Griffiths
Date: 16:24:03 01/31/01
Go up one level in this thread
On January 31, 2001 at 14:36:34, Severi Salminen wrote: >>>BF=(DEPTH-1)|(Nodes/root_move_count) >>> >>>So it means (DEPTH-1)th root. >>> >>>Example (from Vincent's position): DEPTH=9 plies, Nodes=2'000'000 and we have 38 >>>legal moves in root. >>> ____________ >>>BF=8|2'000'000/38 = 3.9 >>> >>>Could this be close to the truth? >>> >>>Severi >> >>This looks like an nth root of the 2000000/38. How would I code this in C++ to >>get this 3.9 value? My math skill since high school has gone down tremendously. > >Yes, I wrote this: "So it means (DEPTH-1)th root". So DEPTH-1 is the N. In C you >can use math.h library. And this is where you'd need a little math since math.h >doesn't have a function which returns Nth root. It has a function pow(x,y) which >returns x^y. And you can take Nth root from x by x^(1/N) which is pow(x, 1/N). >So below is the correct expression. > >ebf=pow(leaf_nodes/legal_root_moves, 1/(DEPTH-1)); > >Severi Thanks Severi! This confirms what I got from a math guru I work with. Larry.
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.