Author: Dann Corbit
Date: 16:09:30 09/17/02
Go up one level in this thread
On September 17, 2002 at 19:08:09, Dann Corbit wrote:
>On September 17, 2002 at 19:02:24, David Rasmussen wrote:
>[snip]
>>All of these alternative mates are not solutions, that is the point. I don't
>>think any program will have problems finding _some_ mate in these positions. The
>>hard thing is to find the right (shortest) mate in these last positions, with
>>normal playing techniques (null move etc.) .
>
>I disagree. Once a program has found a mate that is proven, the value of the
>solution is +1 from a game theoretic standpoint. The lenght to the mate is
>irrelevant, unless the program has neglected some checkmate rule.
^^^^^^^^^
I meant 'Stalemate' rule, of course.
>As far as
>getting the shortest possible checkmate, that is a job for a dedicated mate
>finder.
>
>>>Test Summary;
>>>Correct : 18/18
>>>Average Time To Solution = 0.25 sec
>>
>>Wasn't there 27 positions?
>
>The 18 were those quickly verified by Chest as correct. The others might take
>longer to prove.
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.