Author: leonid
Date: 07:05:37 04/20/02
Go up one level in this thread
On April 20, 2002 at 08:00:08, Gian-Carlo Pascutto wrote: >On April 20, 2002 at 07:03:58, leonid wrote: > >>[D]b6b/2RBKN2/2qrnR2/2NkNq2/2rPqq2/2QNBP2/qQnRqpQq/3qQ3 w - - >> >>Please indicate your result. >> >>Thanks, >>Leonid. > >71 seconds, Athlon XP 1800 > >Sjeng: prove > >Max time to search (s): 1000 > >P: 0 D: 1705125873 N: 10247431 S: 10247430 Mem: 273.64M Iters: 164154 MaxDepth: >34 >Time : 71.970000 >This position is WON. >PV: d7c6 a8c6 f3e4 f4e4 c5e4 c6b5 b2b5 c4c5 b5c5 e6c5 c3c5 It is interesting to see that your program solved this position by selective in 11 moves. My selective also was not able to find any shorter mate that 11. Probably our selective have similar search pattern. Shortest mate is just one move below. Cheers, Leonid. >-- >GCP
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.