Computer Chess Club Archives




Subject: Re: One mate in 10 to solve. Correction!!

Author: leonid

Date: 07:31:31 08/10/02

Go up one level in this thread

On August 10, 2002 at 09:29:43, Uri Blass wrote:

>On August 10, 2002 at 08:58:32, leonid wrote:
>>On August 10, 2002 at 08:42:53, leonid wrote:
>>>This position have very simple parameter for search but in the same is slow for
>>>my program. This is the reason why I prefer to say in advance its depth.
>>>[D]2q1k1q1/1qrqNqr1/Q3q2Q/1QB1N1bQ/2B1N1b1/P3n2P/ppQ1n1Qp/3RKR2 w - -
>>Since I was forced to come back to my position, I will put here the next 10
>>moves mate that I see to be much easier.
>>[D]N1q1k2r/1R1n1q1N/NbPpPrq1/1P2N1B1/1nBP2nQ/1Ppp1p2/3R4/1K3n2 w - -
>>>Please indicate Your result.
>Yes it is clearly easier than the first position
>Movwi say mate in 10 in 14.1 seconds after calculating 1769643 on p800(16 mbytes

Excellent time since it come close to mine done on specialized mate solver!

Your mate search should be very solid because You came already with solutions
for positions that are heavy. Many programs will hang on them.

Mine is 11 sec. Average 253 KNPS (killo nodes per second). Celeron 600. No hash.
Selective search.


>6 9981 1410 1769643 c6d7 f7d7 e6d7 c8d7 b7b8 d7d8 a8c7 b6c7 h7f6 g6f6 h4h8 f6h8
>a6c7 e8f8 b8d8 f8g7 d8d7 g7f8 e5g6

This page took 0.01 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.