Author: scott farrell
Date: 18:17:42 11/03/03
Go up one level in this thread
On November 03, 2003 at 13:13:31, Mathieu Pagé wrote: You might like to be more specific about your question. Are you talking about "root moves" (which the other posts are talking about) or "all moves in the tree". "all moves in the tree" get a boost in move ordering from iterative deepening because many moves have information in the hashtable from last itereation, so make sure you store all moves that you fail-hi on - and make sure if you find these in the hashtable that you search that move first. Scott >Hi, > >I'm know implementing iterative deepening and i've got to the point where I must >re-order move between iteration according to there result from the last search. > >The question is how should i sort them. Do I, simply, have to sort them with a >standard algorithm like quicksort (that seem to me that will not be so quick :) > >Can you confirm this, or explain me what should I do. > >Thanks > >Mathieu Pagé
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.