Author: Dan Homan
Date: 12:32:50 10/08/97
Go up one level in this thread
On October 08, 1997 at 15:20:38, Dan Homan wrote: > >for a 256K entry table, 32 bit hash code, 30K nodes / sec > (i.e. T = 256000, n = 32, N = 30000/sec ) > > R = 1.78 collisions/sec > >for a 48 bit hash code: R ~ 3E-5 collisions/sec >for a 64 bit hash code: R ~ 4E-10 collisions/sec > Note: for reference... there are ~ 3E+7 seconds per year. - Dan >--------------------------------------------------------------------- >Dan Homan dch@vlbi.astro.brandeis.edu >Physics Department dch@quasar.astro.brandeis.edu >Brandeis University homan@binah.cc.brandeis.edu >--------------------------------------------------------------------- > http://quasar.astro.brandeis.edu/BRAG/people/dch.html >---------------------------------------------------------------------
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.