Author: Sune Fischer
Date: 13:52:06 12/03/01
Go up one level in this thread
On December 03, 2001 at 16:21:38, Dan Andersson wrote: >I said nothing about detecting the collisions. But You might have some hidden >assumptions about the data you get from the hash. And if there is a collision >the assumptions might not hold. One silly example is that the hash move might >not be legal, but you make it anyway and on rare occations the program will >bomb. What happens depends on the implementation. Other more subtle assumptions >could exist depending on how the program is constructed. > >MvH Dan Andersson Please don't misunderstand, it was David R. who said: "No program that I know of deals with collisions gracefully, other than just ignoring them and not detecting them. They do this either because the programmer has judged that they aren't important, or that they are not happening. " So I just want to point out the reason they don't detect collisions is simply that is isn't duable. But you are right about the moves, however I don't think anybody stores moves in a pawn hashtable(?), so a collision here would only give a bad score, not crash the prog. -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.