Author: rasjid chan
Date: 02:46:29 12/14/04
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. 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.
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.