Author: Antonio Dieguez
Date: 10:53:58 09/24/01
Go up one level in this thread
>Several hash into 2 X 32 bit values. You store one value, you use the other >to generate the hash index. This is not quite as safe as a true 64 bit hash >signature where all 64 bits are used, but it is pretty good. If you have >one million entries in the table, your hash key is 52 bits long, effectively, >which is not horrible. Not as good as 64, but not horrible. hi. isn't one million of entries around 2^20, so just 44 bits are used for the key, (not 52) ? what I see is that 48 bits with separate hashindex is already safer than 64 bits without separate index when using just 131072 entries (=47 bits), so I may be not understanding something. Also another stupid question, in another post I see calculated the index for hashtable with HV%N, with N the capacity, in that case is it a bit safer to not use an N=2^something? or it is almost the same or there are drawbacks, or I'm not understanding other thing? thank you.
This page took 0.02 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.