Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nolot #11

Author: Ernst Walet

Date: 11:04:48 04/18/99

Go up one level in this thread


On April 18, 1999 at 01:23:25, Ernst Walet wrote:

>
>
>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.

Trying Nolot #2 with CM6000, The result was that with 32MB the solution was
found 500%! faster than with 8MB, cause it was found one ply sooner.  My first
perception wasn't totaly right (see above).

Here the results with 8MB (and 32MB) hash:

 3:04    (2:55)   1/9   Bf6   0.00
 6:23    (5:43)   1/10  Bf6   0.00
 x:xx    (8:41)   1/10  Rxc5  2.47 (not found at ply 10 with 8MB)
44:??   (xx:xx)   1/11  Rxc5  2.48 (forgot to note the seconds in my
astounishment)

I think I have to settle for the 32MB CM6000, in stead of the 8MB Tascbase for
deep King analysing.

Kind Regards, Ernst-J.

>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.