Author: Bruce Moreland
Date: 13:41:27 01/13/98
Go up one level in this thread
On January 13, 1998 at 15:49:58, Don Dailey wrote: >>This is not perfect. I should probably normalize the numbers somehow so >>that problems in which both of the programs finish very close to the >>maximum allowable times don't get more weight than those in which >>neither of them can quite finish that last ply. Also, this doesn't take >>into account that one of the versions might be getting closer to the >>real answer, and therefore is taking more time per ply. And finally, I >>have had a problem with disk caching -- the second run on any given >>night usually goes faster than the first one
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.