Author: Dann Corbit
Date: 13:32:14 12/09/99
If you only have a small amount of memory and your program calculates a long time, you will obviously get collisions. What I am wondering is: "Has anyone done a careful study of the actual probability of collisions as a function of both the number of hash slots reserved and the number of nodes examined over time?"
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.