Author: Miguel A. Ballicora
Date: 09:00:23 02/04/01
Go up one level in this thread
On February 04, 2001 at 10:46:32, Robert Hyatt wrote: >On February 04, 2001 at 04:50:34, Alvaro Jose Povoa Cardoso wrote: [deleted] >>If I'm not mistaken you said _internal_iterative_deepening_ can be used to fill >>the PV below this point. Can you explain the details, you see I'm a novice on >>this things. >> >>Alvaro Cardoso >> >> > > >I don't use it to fill in the PV. But if I reach a node where I am trying to >find a PV (using PVS I detect this where beta != alpha+1 in the search) and I >don't have a hash-table move to search, I do a short iterated search to find the >best move so that I can try it first and not have horrible move ordering. > >All I do is say "(1) is this a PV node (beta != alpha+1) and (2) do I not have >a hash move to search here?" If the answer to both is yes, I simply call >search with the same position and ply, but depth-2. However, _that_ search >will have the same problem so it too will again call search with depth-2-2, >and so forth... I am curious, would depth-1 take much time? Miguel
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.