Author: Bruce Moreland
Date: 20:11:03 12/08/99
Go up one level in this thread
On December 08, 1999 at 20:03:41, Dann Corbit wrote: >Hash collisions are so improbable that it would be very difficult to pinpoint >that as the problem. But if you shrink the hash tables to 10K or so, I suspect >the problems will show up frequently if not handled correctly [which brings up >the point -- how do you handle hash collisions?]. Every increase in size will >make collisions less likely, but even with a terabyte a collision is possible. >That collision could cause a key choice to be made incorrectly. It's just not >very likely. I handle hash collisions by ignoring them. I'm set up so that if I get one I won't crash, but it could return a bogus cutoff. bruce
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.