Author: Bruce Moreland
Date: 12:41:11 12/18/02
Go up one level in this thread
On December 18, 2002 at 14:47:00, Robert Hyatt wrote: >On December 18, 2002 at 13:47:41, Gian-Carlo Pascutto wrote: > >>On December 18, 2002 at 13:10:09, Robert Hyatt wrote: >> >>>Time by itself is also misleading. >>> >>>It would not be hard to search the PV quickly and then bog down on refuting >>>the rest of the moves, which would allow time-only to produce a false >>>impression. >> >>How is this going to give you faster times exactly? >> > >If you search to time of solution, you get one time. If you search to the >end of that iteration, you get a much _longer_ time. If the algorithm breaks >the search as I explained, either time is misleading by itself... The use of time can be misleading, but that is no reason to ignore it and give every algorithm as much time as it wants when trying to ascertain performance. The eventual goal is to find more stuff faster. The way to tell if something is faster than something else is to have a race. Of course, it is possible to argue that some distances for the race are stupid. It makes no sense to have a 1 centimeter sprint. This does not mean that the whole idea of a race is wrong. bruce
This page took 0.08 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.