Author: Dave Gomboc
Date: 14:23:15 11/21/02
Go up one level in this thread
>Time to solution is not a common method in academic computer chess papers. It is >not generic enough, and is too program dependant to be scientifically >acceptable. > >Apart from a few exceptions, I have seen no other publication which discusses >time to solution. When comparing various searches within a single program, nodes to solution is also okay. Time to solution allows irregularity because of timing anomalies and more generally because the machines one has access to are not dedicated to your task alone (other people can log on and do stuff). If the correlation between nodes and time is tightly linear (usually, it is, for a non-tiny search) then using node counts aids reproducibility of results. Dave
This page took 0.18 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.