Author: Robert Hyatt
Date: 06:24:52 12/14/99
Go up one level in this thread
On December 13, 1999 at 15:11:10, Dann Corbit wrote: >On December 10, 1999 at 22:08:44, Robert Hyatt wrote: >[snip] >>Not exactly. Suppose you have exactly 4 billion (2^32) entries. You can use >>the right-most 32 bits to form the hash probe address, and store the leftmost >>32 bits for verification. You are using _all_ 64 bits. But since the right >>most bits are used for the address, there is no use in storing them at that >>address, right? > >What a beautiful, general purpose technique! > >This could be used for any sort of hash!!! > >I will definitely toss this beauty into my bag of tricks. > >It rates a double-wow! The only bad news is that this has been done forever. :)
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.