Author: Matthew White
Date: 12:47:48 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é For small sets of data, even standard libraries (like the one built into unix), use insertion sort. You might just wish to use a built-in function... Matt
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.