Author: Robert Hyatt
Date: 07:28:44 06/30/99
Go up one level in this thread
On June 30, 1999 at 00:17:05, vitor wrote: >hi, >im currently trying to implement 2 killers into move ordering. if the killers >dont produce a cutoff, would it be faster to remove them from the full movelist >or just research them? thanks In theory, you can research them and get the result from the hash table. In practice, it doesn't work because nothing 'protects' those hash entries and they can be replaced.. I remove them myself, to be sure I don't waste time searching something a second 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.