Author: James Robertson
Date: 18:46:31 08/24/99
Go up one level in this thread
On August 24, 1999 at 14:34:46, Robert Hyatt 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. Oh.... I already do that. I was somehow thinking maybe it might be something different. :) James
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.