Author: Dave Gomboc
Date: 13:42:23 12/09/99
Go up one level in this thread
On December 09, 1999 at 16:32:14, Dann Corbit wrote: >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?" Dennis Breuker (sp?) did some hashing stuff. You could check out his Ph.D. thesis. Dave
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.