Computer Chess Club Archives


Search

Terms

Messages

Subject: Dumb hashing question

Author: Dann Corbit

Date: 12:46:54 12/09/99


If I make a hash key of n bits, how can I make a smaller hash table than 2^n.

I don't get it.  (e.g. My question about shrinking the hash table was met with
"It does not matter how small the table is -- it is the size of the key that
matters.").  This caused me to wonder why my brain is so tiny.  I mean, how can
I have a hash table with a great big key and not allocate enough space to hold
it? Do you have a smaller hash leader (half-key, quarter-key, whatever) and then
throw the rest into a list of some kind?

What gives?



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.