Author: Peter Kappler
Date: 13:04:39 11/21/99
Go up one level in this thread
On November 21, 1999 at 14:59:53, Bert van den Akker wrote: >From the start position I get a branche factor of about 14% > >This is in a 10 ply search from the start position. > >The branche factor is defined as: > >(total_number_of_moves_looked_at_in_a_node_before_cutoff / >total_number_of_generates_moves) * 100 > This is how I used to compute branching factor, too. I still think it's the best way to measure the quality of your move sorting. But, I think most programmers measure branching factor by dividing the total number of nodes search at depth n by the number searched at depth n-1. The latter approach will produce a much smaller BF than your method. --Peter
This page took 0.01 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.