Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Efficient hash algorithm?

Author: Don Dailey

Date: 21:18:49 09/22/98

Go up one level in this thread



By the way, this hash table collision thing is exactly
the same as the birthday parodox if you are familiar
with this.  The odds that there will be at least 2
people with the same birthday in a room with 25 people
is greater than 0.50.  This is equivalent to a hash
table collision in some sense and has the same theory
behind it.

- Don



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.