Author: Slater Wold
Date: 14:02:42 12/06/01
Go up one level in this thread
On December 06, 2001 at 15:21:17, J. Wesley Cleveland wrote: >This problem is like the problem "How many people does it take before >it is probable that two have the same birthday ?". The answer, which >many people find suprising is 23. To calculate this, calculate the >probability p, that two people have different birthdays = 364/365. >Then calculate how many pairs of people n, you need before this is less >than 1/2, p^n <.5. Then find the number of people g, which taken two at >a time is >= n, g = n*(n-1)/2. > >The same method tells you how many different positions you can have >before it is likely that two will have the same hash key. > >32 bits 77163 >48 bits 1.97536627683E+7 >64 bits 5.05693754118E+9 > > >Thanks to Cliff Leitch for providing a high precision freeware calculator. I agree. It's time for 64 bits and integers. On Crafty right now, I cannot search for more than about 6 minutes a position, or the node counter resets. That's a bummer.
This page took 0.01 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.