Author: Larry Griffiths
Date: 12:36:22 09/16/00
Go up one level in this thread
On September 16, 2000 at 14:30:16, Robert Hyatt wrote: > >You have found the fool-proof way of preventing collisions. However, you >also see the cost (that of storing a real board position, even if compressed >a bit). > >Bottom line: some errors are acceptable. Searches are going so fast, the >probability of a collision is pretty high, but the probability of it happening >on a node that is "important" is very low. Which means acceptable. Thanks Robert! I needed verification that this happens with hashkeys. I also noticed that the lower parts of my hashtable have less holes in them when I use hashtable sizes that are not powers of 2. Larry.
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.