Author: Russell Reagan
Date: 14:17:01 03/23/04
Go up one level in this thread
On March 23, 2004 at 16:18:24, Robert Hyatt wrote: >Hashing can cause odd things. > >For example, you ponder for an abnormally long time and finish (say) a 16 ply >search. As you searched position X at ply=1 (not depth = 1 but ply =1...) you >get a "fail low" and store (say) score <= XXX, draft=15. > >Your opponent makes a different move and you start over. When you reach >position X, you get a hash hit and you "fail low" because of it, bit when you >re-search, you can't use that old fail low hash entry and you are not searching >deeply enough to see the 16 ply problem with the move, so you get a screwy >score. > >There is no solution to this... except drop hashing... To be more precise, you don't have to "drop hashing" completely to avoid this. For example, you could still use the hash table only for move ordering and avoid the search instability. Of course, it is less effective then. Pick your poison :)
This page took 0.01 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.