Author: chandler yergin
Date: 00:05:14 06/17/04
Go up one level in this thread
On June 15, 2004 at 15:48:15, David Dahlem wrote: >On June 15, 2004 at 15:46:36, Rolf Tueschen wrote: > >>On June 15, 2004 at 15:45:08, David Dahlem wrote: >> >>>On June 15, 2004 at 15:33:41, David Dahlem wrote: >>> >>>>One of the problems with the current method of testing engines with test suites >>>>(e.g. WM-Test) is the problem of proving that the proposed solution move is >>>>actually the best move, especially with positions of a positional nature. >>>>Perhaps a new method would avoid this problem, namely a suite of mate positions, >>>>with known, more easily proven solutions? Time to solution could be the criteria >>>>by which engines are evaluated. >>>> >>>>Just an idea. Any thoughts? Would this work? >>>> >>>>Regards >>>>Dave >>> >>>This method would also avoid the problem of engines finding the solution for the >>>wrong reason. :-) >>> >>>Regards >>>Dave >> >> >>Yes, hehe, but you wont find an engine that couldn't solve such "problems"... > >Yes, probably true, but not all engines wouldn't find the solution in the same >length of time.... > >Regards >Dave There are positions computers don't understand at all, no matter how much time they have. Humans, still have the edge. ;) CY
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.