Author: Jeremiah Penery
Date: 17:24:44 04/19/99
Go up one level in this thread
On April 17, 1999 at 17:38:06, Bruce Moreland wrote: > >On April 15, 1999 at 18:18:50, Peter McKenzie wrote: > >>The Nolot test suite is a set of 11 very hard test positions, with the 11th >>position being one of the easier ones. I tried it on lambchop last night, chop >>managed to solve it in about 3000sec (50min) on my 133mhz Pentium with 32mb RAM. >> The solution was found at ply 11. How do other programs go on this one? >> >>r1b3k1/p2p1nP1/2pqr1Rp/1p2p2P/2B1PnQ1/1P6/P1PP4/1K4R1 w - - >>Solution: Rxh6 > >My most recent version on a quad Xeon 450 finds this in 54 seconds (ply 12). > >The is actually kind of unlucky. I ran this on one of my last good >single-processor versions, on a P6/200, and it found this in 1:44, so you'd >think that the multiprocessor version should find it in like 15 seconds, but it >misses it and has to pick it up in the next ply. > >When it finds it it's like -1, then comes up to a draw score after a couple of >minutes. I haven't run it long enough to find a win. > >The next Nolot for you to try is 10, and after that 2 or perhaps 1. I don't >think that all of them are sound, but I think that DT II found a few others >after several hours of search time. Which ones do you think may not be completely sound? Thanks. :) Jeremiah
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.