Author: leonid
Date: 08:09:47 08/19/01
Go up one level in this thread
On August 19, 2001 at 02:15:47, Pete Galati wrote: >On August 18, 2001 at 13:17:32, leonid wrote: > >>[D]3k4/3n4/nrqbqrn1/q2b2q1/Q2N2Q1/QQQBQQQ1/3B4/3K4 w - - >> >>Please indicate your result. >> >>Thanks, >>Leonid. > >I have spare time before Mogens & me start the next games so I figured I'd try >running one of your positions. I used Yace (it makes such a cool log file!!) >but I'm not sure how much time it spent, it just ran while I took a nap. > >Yace didn't keep the other side in check the whole time though. > >I asked for 300mb hashtables, I'm not sure what this indicates: > >hash 300M >hash size wanted 300000000 >HASH size/2 12500005 > >It looks like I still need to specify a TB cache size, oops... > >Anyhow, here's it's analysis, and the final position > >3831515520 11116.8 Mat09 8u.: Nd4xe6+ Bd5xe6 Qg4xe6 Rf6xe6 Qe3xg5+ Qa5xg5 > Bd2xg5+ Ng6e7 Qb3xb6+ Qc6xb6 Qa4xd7+ Kd8xd7 > Qa3a4+ Qb6c6 Qa4xc6+ Ne7xc6 Qf3xc6+ [2510] >[D]8/3k4/n1Qbr3/6B1/8/2QB2Q1/8/3K4 b - - 0 9 I am not completely sure at what depth your program found mate, but if it is in 9 (look like it say in 9 moves) then it is right minimum number of moves. If it found mate by selective in 9, it did better that mine that found with selective only in 12 moves. Mine found by selective in 12 moves mate in 7 seconds. By brute force it reached shortest mate 9 moves deep in 2 min and 34 sec. Celeron 600. No hash. Leonid. >Pete
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.