Author: Andrew Dados
Date: 11:35:57 02/20/03
Go up one level in this thread
Small error:
>
>----
> Now to get it all in sorted order:
>
>for (i=254;i>0;i--)
> if (move_number[i] != 255)
>{
> search_move(move_number[i]);
> if (notunique[i])
> //here need to loop through unsorted_values array starting from
>move_number[i]+1
> for (k=move_number[i]+1;k<255;k++)
// ****** of course above should be: k<= max_move
// where max_move is numver of moves generated
> if (unsorted_values[k] == i) search_move(k);
>
>}
>
>of course you may want to optimize that pseudocode :)
>====================================================
>
>
>obvious note: in this pseudocode value of move can't be 0; it is easy to change
>that.
>
>
>-Andrew-
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.