Author: Robert Hyatt
Date: 19:26:41 08/06/04
Go up one level in this thread
One important detail I omitted. When you are nearly out of time, and start the next iteration, if you use aspiration search you have a good chance to fail low if the best move is not that good. If you don't use aspiration search, you may well run out of time before you get a score back, and since you don't realize the move is losing, you won't use additional time to discover this... IE it isn't only about making the tree smaller, it can return information that a non-aspiration search can't do in reasonable time...
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.