Author: Robert Hyatt
Date: 22:07:13 08/24/99
Go up one level in this thread
On August 24, 1999 at 21:50:54, Scott Gasch wrote: > >>It is a terrific help. First thing you do in Search() should be to probe the >>hash table, as a hit prevents further searching of any kind. If you find the >>position, but the depth is not sufficient to use, or the bound that was stored >>is not useful, you should still try the 'best move' that was stored in the >>hash entry, before trying any other moves at all, including captures. > > >Including before PV moves, too? Think about that for a minute... then you will conclude that by definition, a hash table move _is_ a PV move. IE if the move from the hash table was not the move in the PV at this point, how did that move get into the PV without being the best move in this position?
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.