Author: Russell Reagan
Date: 20:00:45 01/27/04
Go up one level in this thread
On January 27, 2004 at 22:43:10, Dann Corbit wrote: >If it fails high, chances are that our choice of the pv node is a good one. If >it fails low, then we better look again. We already know that our best guess >stinks. If we don't improve it, what will we end up searching? > >IOW, if your 'best node' guess fails low -- it's bad. > >And if your 'best node' guess fails high -- it's good. We don't care what the >real value is because we are going to search at greater depth anyway. > >We just want an idea of where to look first. Ah, so this is similar to one of those situations where an engine will do a root aspiration search and fail high, and the engine will output a new move without a score or without a PV (or without both), and you have to search with a wider window to get the real score, but can safely play the move, right? And, the only problem Bruce was trying to avoid was causing an infinite loop, right?
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.