Author: rasjid chan
Date: 08:39:36 05/10/05
I am implementing hashing double bounds and need to know if there is a generally accepted practice for the case when probe hash is an upper bound for a higher depth:- full search with bounds alpha, beta, probe hash is an upper-bound for a greater depth - value is ub_higer_depth 1) if alpha >=ub_higer_depth - fail low, return alpha; 2) if alpha <ub_higer_depth, all moves are searched and the result is an exact value ex; a) we simply return ex; b) if alpha < ub_higer_depth < ex < beta, Is it not better to return ub_higer_depth instead of ex ? ie an "adjusted" exact score. How do strong programs like crafty/fruit treat the case ? Thanks Rasjid
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.