Author: Michael Henderson
Date: 15:03:55 09/16/04
Go up one level in this thread
On September 16, 2004 at 17:37:48, Stuart Cracraft wrote: >Hi -- my program's branching factor on an old IBM notebook >for Win-at-Chess at 1 second per move on is 4.28 solving245/300 positions. > >This is too high a branching factor. > >(It was calculated by averaging all the timeperply/timeperpreviousply for all >iterations on all problems in the suite.) > >What do people do when their branching factor is too high. What kinds of things >best improve the branching factor? > >Thanks -- Stuart Wouldn't it be best to average the last two iterations since they are most related to move ordering? Also it would be interesting to look at the branching factor for individual problems--large qsearch/extension positions tend to have large effective branching factor. I think you already have some good move ordering stuff so that is probably not the problem... good luck, Michael
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.