Author: Larry Griffiths
Date: 15:32:26 09/16/00
Go up one level in this thread
On September 16, 2000 at 17:04:23, Dan Newman wrote: > >I once tried to measure the error rate and got no errors at all with 64-bit >hashcodes over several hours of testing. I was able to measure the error rate >for 32-bit hashcodes--that was about 1 false match/second (at perhaps 100k >probes/s). I think someone came up with an estimate of (very approximantely) >one error/day with a 64-bit hashcode at 100 knps--or was it 1 Mnps? Anyway, >the error rate is very low and can mostly be ignored. I do try to make sure >that such an error won't crash my program though... > >-Dan. Thanks for the info Dan! My piece position table is 12x64. I use random numbers currently eliminating duplicates or zero keys in the position table. Maybe I should try to figure some error rates like this. Great idea. Seems like there was a reason to keep track of castleing status in the hash-table but I dont remember why. Might have to read my "How computers play chess" book again. Larry.
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.