Author: Daniel Clausen
Date: 00:10:36 07/20/04
Go up one level in this thread
On July 19, 2004 at 23:02:40, Robert Hyatt wrote: [snip] >Too much trouble. When you finish an iteration, simply make sure that _all_ PV >positions are in the transposition table along with the best move from the >actual PV. Since you should always try the transposition table move first, >this guarantees you that you will search the PV moves first with no extra >code or overhead of any kind in the search. I guess that's the best solution overall which I will use in my new engine too. The not so elegant part is that 'searching the PV first' and hashtables are coupled - if you turn off HTs you no longer search the PV first. I guess as soon as you have a reliable HT-implementation, this is a minor point though. Sargon
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.