Author: GBes
Date: 12:40:52 07/23/99
Go up one level in this thread
On July 23, 1999 at 11:42:07, Scott Gasch wrote: >Hi. > >I have implemented hashing (transposition) tables based on crafty's code and >some posts about it here. It makes sense and works very well... but I am having >trouble with one aspect of it. > >In a position where the side on move has a very good move (promote a pawn, >capture a queen, etc) I am hitting the hash table at every depth of my search >and the table is returning a bound instead of an exact score. This happens, for >example, on plys 1 through 6. The program then begins to search ply 7 but runs >out of time. Since plys 1-6 were bounds from the hash, I have no move at this >point. Don't know if i understand well your problem...(still struggling with hashtables too) Seems to me that every hit to the hashtable should you give a SCORE ( exact lower upper worthless ) plus *always* an associated move, even if the score is just a bound. this works for me. good luck, gerrit bes
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.