Author: Tom Kerrigan
Date: 00:59:50 05/23/00
Hi guys, Is there a good way to measure search efficiency? In the past, I've gone through test suite logs and compared nodes/ply for each problem by hand. This is obviously undesirable. :) Is there some way I can get a good "magic number" to indicate how efficient my search is? Is branching factor good or bad? Is there something similar but better? Thanks, Tom
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.