Computer Chess Club Archives

Search

Messages

Subject: Re: One easy mate to solve.

Author: Paul

Date: 11:07:13 11/15/01

Go up one level in this thread

On November 15, 2001 at 13:35:16, Gian-Carlo Pascutto wrote:

>On November 15, 2001 at 09:09:08, leonid wrote:
>
>>[D]2nkN3/2nqN3/2rrbb2/RBqQQqQQ/RBqNPqPQ/2qpqp2/3B4/3K4 w - -
>>
>>Please indicate your result.
>>
>>Thanks,
>>Leonid.
>
>Sjeng: prove
>
>Max time to search (s): 20000
>
>P: 0 D: 100000000 N: 599643 S: 599642 Mem: 25.16M Iters: 10534 MaxDepth: 33
>Time : 7.470000
>This position is WON.
>PV: e7c6 c5c6 e5f6 f5f6 g5f6 f4f6 h4f6 d7e7 f6e7 c8e7 d4e6 c7e6 a5a8 c6a8 d5d6
>d8c8 a4a8 c8b7 d6a6
>
>7.5 seconds
>
>--
>GCP

Hi GCP,

Is there any known method of finding a shorter, or the shortest mate with
proof-number search after a mate has been found? Is any research being done in
that area that you know of?

Paul

• Re: One easy mate to solve. Gian-Carlo Pascutto 11:31:59 11/15/01
  • Re: One easy mate to solve. Paul 11:41:42 11/15/01

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.