Computer Chess Club Archives

Search

Terms

Messages

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

Author: Jari Huikari

Date: 02:48:18 10/16/99

Go up one level in this thread

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...

					Jari

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.