Author: Bruce Moreland
Date: 15:59:58 07/11/01
Go up one level in this thread
On July 11, 2001 at 18:35:48, Dan Homan wrote: >On July 11, 2001 at 16:37:38, Dann Corbit wrote: > >>On July 11, 2001 at 16:16:29, Artem Pyatakov wrote: >> >>>I was just in the process of making my own program hash, and I was looking at >>>the Gerbil 01 source code for some guidance, but I noticed something strange. >>> >>>Does Gerbil at this point NOT hash En Passant squares? >>>Am I correctly thinking that this information should be hashed? >> >>Gerbil has the smartest e.p. hashing of any program I have ever seen. I intend >>to brashly copy it, as soon as I find the time. >> >>Gerbil hashes ONLY those e.p. information points where the pawn can *actually* >>be taken which is just plain brilliant. It will result in a lot more hash hits >>for no apparent penalty. >> >>An example of the genius of Bruce Moreland. > >I think this idea has been around for a while... although I might just think so >because Bruce Moreland mentioned it somewhere else... One wrinkle is that I >thought most programs did this in their make-move routine (which, of course, >updates the hash signature of a position). I am surprised that it would be a >bigger savings to do this when actually retrieving or storing the hash entry, >but I haven't looked at Gerbil's code yet (it is on my todo list), so I don't >know. I think that messing with the flags in the hash table store/probe is a cool idea and I'm going to go try to implement it in both my programs now. bruce > > - Dan
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.