Author: Sune Fischer
Date: 10:01:22 07/11/04
Go up one level in this thread
On July 11, 2004 at 11:05:55, David Rasmussen wrote: >On July 11, 2004 at 10:39:01, Renze Steenhuisen wrote: > >> >>What do you mean by proof? Give the chance that it is happening? I can send you >>a thesis of someone who has it a small little graph if you'd like... Simply ask >>me by mail (renze@ch.tudelft.nl) >> > >I have done informal extensive tests myself that suggest that collisions with >64-bit hash keys happen very infrequently. Infrequently enough to make it a >non-issue. But I would like to reference something that has formally dealt with >this, instead of just saying "take my word for it". Better yet is to show the calculations. By making a few almost realistic assumptions (e.g. the prng is perfect) it shouldn't be hard to get a good lower bound for the collision rate. You may try the archives, I believe it's already been posted here a few times. -S.
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.