25,161
edits
Changes
no edit summary
==[[Tony Warnock]]==
on ''Search Tables in Computer Chess'' <ref>[https://groups.google.com/group/rec.games.chess/msg/2a4183cb654443dc?hl=en Re: Hash tables----Clash!!!-What happens next?] by [[Tony Warnock]], [[Computer Chess Forums|rgcc]], March 17, 1994</ref> <ref>[[Tony Warnock]], [[Burton Wendroff]] ('''1988'''). ''Search Tables in Computer Chess''. [[ICGA Journal#11_1|ICCA Journal, Vol. 11, No. 1]]</ref>:
The following paper describes a method of generating the numbers for a hash table. By using [https://en.wikipedia.org/wiki/Error_detection_and_correction error correcting codes], we ensure that positions that are close on the board are not close in the hash space. Some experiments showed that we got an improvement in collision rate compared to using a [[Pseudorandom number generatorNumber Generator|random set of numbers]].
[[Mathematician#JMacWilliam|MacWilliams]] and [[Mathematician#NSloane|Sloane's]] book on error correcting codes <ref>[[Mathematician#JMacWilliam|Jessie MacWilliams]], [[Mathematician#NSloane|Neil Sloane]] ('''1981'''). ''[http://www.sciencedirect.com/science/bookseries/09246509/16 The Theory of Error-Correcting Codes]''. North-Holland Mathematical Library, [http://www.amazon.com/Theory-Error-Correcting-North-Holland-Mathematical-Library/dp/0444851933 amazon]</ref> has the glory details about the theory and programming.
