Author: Robert Hyatt
Date: 10:00:12 12/14/04
Go up one level in this thread
On December 14, 2004 at 05:46:29, rasjid chan wrote: >I hope somebody could comment on these : > > >1) Intrinsic Search Inconsistency from Hashing - >This may result solely from the fact that we may use hash information from a >higher depth search which may not yet be available in an earlier search of a >similar node. That is one reason. There are other kinds of problems, such as missing draws or finding draws that are not there because the game depends on move history, but hash entries do not have that information. > >2)In the case of implementing hashing double bounds, we may find an UB < LB. >Say when we search a node, probehash already has a LB x_lb and >we search with (a, b) where a > x_lb. >The node fails low (fail soft) giving x_ub < a; with search inconsistency >we may have x_ub < x_lb; ie an upper bound < lower bound for the same search >depth. How can we resolve this conflict. > >Thanks >Rasjid, snailchess. null-move causes a problem. If the above has that kind of UB < LB and both UB and LB have the same _draft_ then there is a problem and it should not happen. If the UB and LB are for the same position with different drafts, then it can happen easily.
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.