Author: James Robertson
Date: 10:40:28 08/20/99
Go up one level in this thread
On August 20, 1999 at 12:24:44, Jon Dart wrote: >Actually, the first thing I'd look for is the logic you have for >storing and retrieving hash values. If you do not always correctly >identify the node type (fail-high, fail-low, or in bounds) or >if you do not properly set the search bounds after a hash hit, >you will have problems like you describe. Having "almost right" >logic will appear to work for a while, but sooner or later you >will pull a bad value out of the hash table and you will be >hosed. > >Unlike many areas of computer chess, there is really only one >right way to do this. Look at Arasan, Crafty, or Gnuchess source >and do what they do (in Crafty, look at hash.c). > >--Jon I have tried to look at Arasan source several times and was always completely confused. Crafty is confusing because the hash stuff is split between 2 files. EXchess is of some help. The only program that is not confusing is JRCP, and it has too many bugs. :( James
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.