Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nolot #11

Author: Ernst Walet

Date: 22:23:25 04/17/99

Go up one level in this thread


On April 16, 1999 at 14:04:22, John Stanback 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
>>
>>
>>cheers,
>>Peter
>
>Zarkov takes about 30 minutes on a K6-333 to find Rxh6 in the 12th
>iteration.
>
>John


And CM6000 gives the following result with 8MB (and 32MB) hash:

1:04   (1:05)   1/9   Bxe6   -4.40
1:45   (1:45)   1/9   Rxh6   -3.24
2:27   (2:24)   1/10  Rxh6   -0.75
4:08   (3:46)   1/11  Rxh6   -0.75

so solves it in 105 sec.

Ernst-J.

The reason to test it with 8MB and 32MB hash is that I want to determine if The
King engine in Tascbase 2.1a suffers much from it's limitation of 8MB hash.

So far I've found, in CM6K, on a K6-200, a penalty of 3% at 3 min., a penalty of
5% at 3 min., a penalty of 14% at 10 min., and a penalty of 17% at 30 min..

What penalty should I expect at a overnight analysis?  I expect that the curve
flattens out at longer time controls at maybe 25% or so.  Still 25% of about 8
hours gives a total time of 10 hours.  Maybe a programmer could shine a light on
this.

What I also noticed is that The King, as far as I can tell, does not rely on the
hash table for it's evaluation.  It still finds moves at the same ply depth with
the same, or about the same score with different hash sizes, only the time
differs.  Rebel for example sometimes finds moves at a certain ply depth in a
certain time with 60MB hash, but doesn't find it with 40MB hash at all, or much
later at much deeper ply depth.

My conclusion sofar is that The King does not rely on hash tables for evaluation
and that Rebel does, is this right?

Kind regards, Ernst-J.



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.