Author: Jan Pernicka
Date: 03:39:07 05/23/00
Go up one level in this thread
On May 23, 2000 at 03:59:50, Tom Kerrigan wrote: >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 Hi, sooner you get cutoffs, more efficient your search is. So one possible way is to measure this, e.g. compute frequency of getting cutoff at first move in the node - only when cutoff is possible (ie. you get it eventually). This is similar to branching factor but can be modified and IMHO is not so time consuming. BTW how do you compute branching factor (BF)? Better say - how is it defined for trees with leaves at different depths? - my suggestion is - the same! - but you should choose the appropriate depth - maybe the greatest depth D reached - and then BF could be D-th root of number of leaves visited. And, of course more important is the last depth when using ID - depend also on number of nodes that have been visited. - Is this all true? Jan
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.