Author: Russell Reagan
Date: 06:19:15 06/27/03
Go up one level in this thread
On June 27, 2003 at 08:13:53, Albert Bertilsson wrote: >As I've improved moveordering very much with hashtable/iterative deepening, >killer moves and history tables the effective BF is now much lower. The lower BF >now means that very few moves of all the generated ones are actually ever made. >This means that the cost of generating legal moves have increased incredibly >much. What is the overall effect of having a lower branching factor and a slower program? If the overall effect is that your program is stronger than it used to be, then that is a good thing. Nodes per second isn't what determines how good your program is.
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.