Author: James Swafford
Date: 20:42:29 09/22/01
Go up one level in this thread
On September 22, 2001 at 22:17:06, Uri Blass wrote: >On September 22, 2001 at 19:08:06, Torstein Hall wrote: > >>On September 22, 2001 at 18:29:46, Andreas De Troy wrote: >> >If the hash tables are very big then the probability for hash collision can >increase and if there are enough hash collisions the result can be a bad move. > >Uri Why do you think the size of the table has any bearing on the number of collisions? The number of collisions is a function of the "uniqueness" of your key, not how many entries are in your table. Maybe my definition of a collision is different than the norm: I define a collision as a match of the entire key between different positions, not a match of the portion of the key used as a probe into the table. Either way, I don't see how making the hash table bigger increases the chance of a collision. Would you explain? -- James
This page took 0.03 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.