Computer Chess Club Archives




Subject: Re: is the

Author: Komputer Korner

Date: 15:39:13 08/03/98

Go up one level in this thread

On August 03, 1998 at 08:24:04, Tom Kerrigan wrote:

>I think it's interesting that you invented a new word and expect everybody to
>understand it. Unless a program is brain-dead, it uses this "block hashing," so
>why don't you just say "hashing" like everybody else?
>You can ask my program to use whatever amount of memory you want, and it uses
>2^x entries, such that the hash table fits in the size you requested. If you ask
>it to use 127 MB, it will use 64 MB.
>As for hash tables "filling up", this is a total non-issue, as I've explained
>before. The hash table does become less and less beneficial as the search goes
>deeper and deeper. However, this is NOT a reason for people to rush out and buy
>more RAM. If you can convince me that using a 64 MB hash table gives you 50 more
>rating points than using 32 MB, even at long time controls, I may consider
>buying more RAM...

Something I still don't understand here. Some programs let you put in increments
of hash tables in their menu that are not powers of 2. Rebel 9 has increments of
2,2.5,3,4,5,6,10,13 etc.  for example. For long analysis, if you have large
enough hash tables you can indeed have a program that is 40-50 points stronger
than one with small hash tables.
Komputer Korner

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.