Author: Bruce Moreland
Date: 13:00:31 01/20/98
Go up one level in this thread
On January 20, 1998 at 15:27:01, Robert Hyatt wrote: >yes. it's old news. And a data structures course would call this >the "hash collision chain problem". rehashing eliminated chains, but >produces more cache thrashing... the latter is more important on a PC >that already has poor memory bandwidth... Assume hash keys are perfectly random, there should be no discernible relation between distinct positions, no matter how similar they are. So if you hash to index I in the table, there should be no more liklihood that there is an occupied entry at index I+1 than there is at index I+K or I+rand(), right? If there is complete entropy here, chaining should be uniform, regardless of how you rehash. So you should be able to use I+1, since that is easiest, if you really want to rehash. The fact that the hash elements are next to each other in memory, and can be accessed with an index, has nothing to do with anything, does it? There is no more relation betwen I and I+1 than there is between I and J. The above is my intuition. Intuition also tells me that the world is flat, though. bruce
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.