Author: leonid
Date: 14:40:17 01/09/02
Go up one level in this thread
On January 07, 2002 at 13:29:09, Heiner Marxen wrote:
>On January 07, 2002 at 11:34:03, Vincent Diepeveen wrote:
>
>>On January 07, 2002 at 11:22:18, Robert Basham wrote:
>>
>>>Extreme Chess takes 15 ply and 42 sec. to find
>>>1. Rh8+...! but then has trouble playing it out to the end...
>>>
>>>(The same kind of problem occurs with Hiarcs7 also)...
>>>
>>>[D]qn1rn1k1/2rp2N1/2b1p1K1/4Bp2/p7/1p6/2p5/7R w - -
>>
>>diep single cpu:
>>
>>process 0: engineflags = 0 denktime=10000000 maxtime=10000000
>>00:00 0 0 58 (0) 1 -40.168 Be5xc7 Bc6xh1 Bc7xd8 Ne8xg7
>>00:00 0 0 203 (0) 1 -29.508 Ng7xe8
>>++ h1-h8
>>00:00 0 0 423 (0) 1 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-g4 Kh8-g
>>8 Ng4-f6
>>00:00 0 0 574 (0) 2 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-g4 Kh8-g
>>8 Ng4-f6
>>00:00 0 0 1644 (0) 3 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-g4 Kh8-
>>g8 Ng4-f6
>>00:00 0 0 3310 (0) 4 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:00 0 0 7423 (0) 5 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:00 0 0 9896 (0) 6 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:00 0 0 19856 (0) 7 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:00 0 0 59143 (0) 8 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:01 0 0 121965 (0) 9 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:03 0 0 242160 (0) 10 0.000 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-e8
>>00:05 0 0 442239 (0) 11 MATE12 Rh1-h8 Kg8xh8 Ng7xe8 Kh8-g8 Ne8-f6 Kg8-h8 Nf6-g4
>>Kh8-g8 Ng4-h6 Kg8-f8 Be5-d6 Kf8-e8 Nh6-g8 Rd8-c8 Ng8-f6 Ke8-d8 Kg6-f7 Rc7-a7 Nf6
>>-e8 Rc8-c7 Bd6-e7 Kd8-c8 Ne8-d6
>
>To verify that this is the shortest and unique mate Chest needs 70 minutes
>on an Athlon XP 1500+ with 128MB hash:
>
>PV: Rh8+ Kxh8 Nxe8+ Kg8 Nf6+ Kh8 Ng4+ Kg8 Nh6+ Kf8 Bd6+ Ke8 Ng8 Rdc8 Nf6+ Kd8
>Kf7 Rb7 Ne8 Rcc7 Be7+ Kc8 Nd6#
>
>(nearly identical)
>
># 4 0.03s 2kN [ 6.98] 1.15 544- 0
># 5 0.14s [ 4.67] 11kN [ 5.04] 1.54 2653- 0
># 6 0.64s [ 4.57] 53kN [ 4.83] 1.95 13440- 0
># 7 2.80s [ 4.38] 273kN [ 5.12] 2.54 65346- 0
># 8 10.33s [ 3.69] 1133kN [ 4.15] 3.28 266081- 0
># 9 39.14s [ 3.79] 4414kN [ 3.90] 4.08 1025109- 247
># 10 152.42s [ 3.89] 16877kN [ 3.82] 4.80 3914255- 852071
># 11 724.66s [ 4.75] 77909kN [ 4.62] 4.82 18536276- 15337043
># 12 4199.66s [ 5.80] 454667kN [ 5.84] 4.79 107933663- 104734430
>
>Hey, Leonid, how does your EBF look like, here?
Hi, Heiner!
My number for brute force search:
Moves Time Branching factor NPS
4 0.1 sec 82k
10.5
5 1.13 sec 76k
12.5
6 14.45 sec 82k
11.18
7 2 min 41 sec 67k
7.26
8 19 min 29 sec 8.22
8.22
9 2 hours 40 min 2 sec
I stopped here since my branching is not very brilliant here and even 10 moves
will take too long time to wait for response.
This position was very useful, since I was not able to solve it by selective.
Trying to solve it by selective, did next version that should solve many
positions that, like actual, was accessible only by brute force, or by selective
but asked few moves more. Still was not able to see if new version should be
included in my program. Before I will know, I need to see many old positions
where selective failed in some way. For now I tried around 10 of them. Look like
very promissing.
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.