Computer Chess Club Archives


Search

Terms

Messages

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

Author: Antonio Dieguez

Date: 16:29:17 10/15/99

Go up one level in this thread


On October 15, 1999 at 15:28:55, Robert Hyatt wrote:

...
>>>No.. he makes a pass over the entire move list to pick the move with the
>>>highest 'priority'.  Then the next time he wants a move, he does this again.
>>>One pass per move is the only way I can see to do it unless they are actually
>>>sorted by priority first, which is a waste of cpu cycles...
>>
>>but he has only 7 level prioritis, or he said another thing?
>
>sure, but he generates moves in random order and attaches a 'priority' to each
>one.  You have to either (a) scan the entire list and pick the remaining move
>with the highest priority or (b) know which priority you are looking for and
>scan (on average) 1/2 of the list to find it, assuming there is a move with such
>priority.
>
>still N^2 basically... no matter how you cut it...

ok, first of all I was no counting ataching the prioritys, anyway he knows what
he do.

>>well, another question, is good to maintain 1 killer capture? I think yes...
>>who maintains a killer capture?
>>
>
>
>nobody I know of... why?  because we try captures _before_ killers anyway,
>at least those that don't appear to instantly lose material.  So by the time
>we get to killers, the captures are already rejected.

sure! I was not saying that.

(killers moves->before others moves , killer capture->before others captures)

>>me.
>>(the prince of amy mizuno, sailor mercury.)

me again.



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.