Computer Chess Club Archives




Subject: Re: is the

Author: Tom Kerrigan

Date: 05:24:04 08/03/98

Go up one level in this thread

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


On August 02, 1998 at 15:29:39, Komputer Korner wrote:

>Block hashing is the fact that hash tables are constructed in powers of 2. BTW
>can you explain to me why some programs allow blocks of hash tables in amounts
>such as 16, 32,64, and 128 Mb wheres others allow you to put in whatever figure
>you want? I am not trying to create a scandal here. I am defending WIN 95. Any
>long analysis causes the hash table to fill up and once it is filled the engine
>search decreases in speed by as much as 50%. This is significant. So for long
>analysis times you can never have a big enough hash table. You know all this.
>Komputer Korner

This page took 0.01 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.