Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast way to sort moves in movelist ?

Author: Antonio Dieguez

Date: 14:43:58 10/16/99

Go up one level in this thread


On October 16, 1999 at 05:48:18, Jari Huikari wrote:

>Here is what I do: (The IDEA not ACTUAL CODE)
>
>I:=1;
>REPEAT
>  j:=0;
>  REPEAT
>    j:=j+1;
>    IF (move[j].priority<>I) THEN DO NOTHING
>    ELSE calculate_score_for_move[j];
>  UNTIL (cutoff OR j=numberoflegalmoves);
>  I:=I+1;
>  UNTIL (cutoff OR I>7);
>
>
>calculate_score_for_move[j] takes much time,
>and DO NOTHING doesn't take much time...

7 loops over the movelist then...

>					Jari

bye Jari, mmh you are the autor of Nero? or I am wrong?

me.



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.