Author: José Carlos
Date: 00:15:26 09/09/00
Go up one level in this thread
On September 09, 2000 at 02:02:46, TEERAPONG TOVIRAT wrote: >Hi, > >I want to estimate the efficacy of each method >of moveordering() . Some problems arise. > >Should I use branching factor to determine the >efficacy ? If so,the next problem is how to obtain >the factor ? It varies from ply to ply and from >game to game. In order to approximate it, should >I use geometric mean or arithmetic mean ? > >Or it would be better to use total searching time ? >How u did it ? > >Thanks, >Teerapong My advise: choose a set of different positions where you have opening, midgame, endgame, tactics, strategics... Then, you can use those positions to measure a lot of data of your program (branching factor, nps, influence of extensions or pruning...). I think it's not important how you measure branching factor if you do it always the same way. The comparison with other programs is difficult, but what is really important for you is the comparison between your program versions. A simple method I use is search those positions to a fixed depth and compare the number of total nodes. José C.
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.