Author: Gian-Carlo Pascutto
Date: 22:00:44 06/16/02
Go up one level in this thread
On June 16, 2002 at 23:25:01, Robert Hyatt wrote: >It doesn't solve the problem. You get a "deep" hash entry match that says >score is >= X, but when you re-search, you can't prove it with a shallow >search. Either you get a fail low, or a score that is worse than the best move >you have found so far, which will cause further mischief... The advantage of the method given is that if without the hashtables you would have gotten a normal score back, the research that cannot use the hash value will return a value that is in the window, and you avoid the last research with the completely open window. What 'further mischief' did you have in mind? -- GCP
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.