Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A mate for Leonid

Author: Olaf Jenkner

Date: 15:36:18 10/11/01

Go up one level in this thread


On October 10, 2001 at 20:01:06, Uri Blass wrote:

>On October 10, 2001 at 16:55:04, Dann Corbit wrote:
>
>>On October 10, 2001 at 16:51:30, Olaf Jenkner wrote:
>>
>>>Gustav needs 2 seconds to find the mate.
>>
>>Is that a proof, or is it a selective search?
>>
>>If mate is proven in 2 seconds, that is incredible.
>
>It is clear that it is a selective search because gustav is not a mate prover
>but a mate finder and it does not look for the shortest mate.
>
>Even chest cannot see the mate in few seconds but it has no problem to see no
>mate in 11 in relatively short time(some minutes on p200).
>
>Uri

Gustav proved that there is no other and no shorter mate when white lets
the black king no flight.

OJe



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.