Author: J. Wesley Cleveland
Date: 11:43:08 08/17/00
When you have a fail-low in a deep search where the value drops significantly, finding an alternate move can take a very long time. This is largely because the values in the hash table are largely useless, so in effect we are researching the entire tree. It seems to me one should use iterative deepening, and start from ply 1 again.
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.