Author: Gerd Isenberg
Date: 11:31:49 11/03/03
Go up one level in this thread
On November 03, 2003 at 13:13:31, Mathieu Pagé wrote: >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é Mathieu, if quicksort is aleady linked to your program you may use it at the root. But whether you sort the root list once before each iteration and get from top to bottom or pick the best each time is rather unimportant at the root, considering the effort of the whole tree search. More important is to assign "right" values to the root-moves, before a iteration starts, depending on the previous iteration. Of course the best so far should be the first. I use initially with some K*eval score after making the root moves, but i also adjust move score values after each iteration by the relative time consume of each move. Moves searched relative longer in previous iteration got searched earlier in next iteration. Gerd
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.