Author: Bruce Moreland
Date: 12:14:11 09/13/01
Go up one level in this thread
On September 13, 2001 at 13:29:00, Dann Corbit wrote: >The approach used in Beowulf is to calculate average time to solution and other >statistical data of that nature. That way, if you can reduce solution time, you >can still glean data even from the easiest possible data set. Yes, but in large part you are dealing with solution times that are measured in fractions of a second. It might be valid to look at this kind of thing. If you run these for one second each, perhaps you get some information about how your tree works near the tips. This isn't the kind of suite you'd use to see how you'd behave at tournament time controls. And you can't use it to evaluate changes to SMP search, since that gets much more efficient if you leave it running for a while. If you are talking about letting solved positions run for a while, in order to get information from that, these aren't the positions I'd choose, since I'd rather optimize time taken to find the tactical move, or time taken to get to a deep depth in a positional case. After the game is over, it doesn't matter how deep you get. bruce
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.