Author: Robert Hyatt
Date: 13:32:19 06/25/99
Go up one level in this thread
On June 25, 1999 at 14:21:54, walter irvin wrote: > exactly how does it work??? At the root of the search, when a move drops significantly in score from the search for the previous move, crafty writes the position and the new score out to disk. This gets loaded into the hash table when it is started for a new game and will let it see at least a couple of moves earlier that something bad happens later, so that it can change quicker...
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.