Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: One mate to solve.

Author: leonid

Date: 19:00:22 01/12/02

Go up one level in this thread


On January 12, 2002 at 11:20:21, Heiner Marxen wrote:

>On January 12, 2002 at 09:47:09, leonid wrote:
>
>>[D]KnqqkqnQ/1QqrrqQ1/2QqqQ2/1bBNNBb1/1Q4Q1/P6P/2p2p2/3RR3 w - -
>>
>>Please indicate your result.
>>
>>Thanks,
>>Leonid.
>
>This one is "easy" for Chest.  After 4.3 minutes it announces two solutions
>in 10 moves:
>
>PV: Nxc7+ Qcxc7 Qxf8+ Kxf8 Qxg8+ Kxg8 Qgxg5+ Qg7 Qgxg7+ Rxg7 Bxe6+ Rdf7 Bxf7+
>Qxf7 Qbxf7+ Rxf7 Qg2+ Rg7 Qfxg7#
>PV: Qxf8+ Kxf8 Qxg8+ Kxg8 Qgxg5+ Qg7 Bxe6+ Rxe6 Qxe6+ Qxe6 Qxe6+ Kh8 Qbh4+ Qh7
>Ng6+ Kg7 Nf8+ Qg6 Qgxg6#
>
>EBF is very good this time, and the hash table appears to be very important
>for this problem:
>
>#  3      0.02s [  2.00]        1kN [  9.86]  0.94         95-         0
>#  4      0.11s [  5.50]        6kN [  6.44]  1.03        729-         0
>#  5      0.48s [  4.36]       29kN [  4.57]  1.23       3504-         0
>#  6      2.28s [  4.75]      129kN [  4.40]  4.38      15765-         0
>#  7      7.41s [  3.25]      413kN [  3.20] 13.02      50036-         0
>#  8     21.06s [  2.84]     1195kN [  2.89] 25.65     137982-         0
>#  9     78.95s [  3.75]     4625kN [  3.87] 27.37     501489-         0
># 10    258.99s [  3.28]    16220kN [  3.51] 24.70    1453974-         3


Hello, Heiner!

As I see this position was easy for you but not necessarily for everybody. I
still hope that one day some next solver will come with its result for brute
force. This will give more perspective to our time.

For me this position was useful in order of seeing if new version of brute force
(just worked for last few days) give the same time as before. Now I have less
specialised version for brute force search. It look for solution in the same way
as selective. I still must see if result for brute force is still very close, or
even better, that it was before. If this is true (still one week for
verification) then solver will gain one more selective search when reducing all
versions of search (before had five of them) to only one working part. I still
not came to speeding related writing. This should come later.

Solver time for this position:

Move           Time          Branching factor          NPS.

4              0.21 sec                                86k
                             3.75
5              0.82 sec                                73k
                             6.4
6              5.27 sec                                71k
                             4.44
7              23.46                                   99k
                             4.66
8              1 min 49 sec                            156k
                             5.12
9              8 min 33 sec

Cheers,
Leonid.




>Cheers,
>Heiner



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.