Computer Chess Club Archives


Search

Terms

Messages

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

Author: leonid

Date: 04:59:32 10/16/99

Go up one level in this thread


On October 15, 1999 at 23:52:16, Antonio Dieguez wrote:

>On October 15, 1999 at 22:54:36, leonid wrote:
>
>...
>>>>>My program is very different from the most of other programs. I have only
>>>>>written a primitive program, in my way. And done changes which have made
>>>>>_it_ better, but are done in a different (and more effective) way in usual
>>>>>programs. :-) In _my _program_ my movesorting doesn't make anything slower.
>>>>>(I generate _all_ the legal moves before I try any. It may be one difference.)
>>>>>
>>>>>					Jari
>>>>
>>>>Are you saying that usually people find and do movesorting before recognizing
>>>>what move is legal? I am asking this question not because I contest what you
>>>>have said but for simple curiosity.
>>>
>>>hi leonid!
>>>
>>>if am not wrong, I guess that the point is that he generates *all* the legal
>>>moves before he tries any.
>>>
>>>>Regards,
>>>
>>>thx!
>>>Sailor Mercury and I send to you many regards!!
>>>
>>>>Leonid.
>>>
>>>me.
>>
>>I read with great interest your chat because it says me a lot. Sometime I am
>>lost in your too technical expressions.
>
>really? :)
>
>> Anyway, if you could say how many moves
>>per ply, in general, you are forced to see it will be useful. I still could not
>>find directly efficency of my move ordering to offer my way as the good one.
>>Each time when I tryed my game against the best one, I found that my numbers
>>were not right because some wording I understood in a wrong way. So, how many
>>your game see in the ply where we have around 30 nodes, for instance?
>
>but that depends on the position... if you send me some, I could tell you the
>amount of nodes for each ply...
>oops I can not set up positions yet in my game... but anyway they are big
>numbers for me in the middlegame for iteration 7, 8 or more...
>
>What do you mean with "forced to see"? the minimum minimum is the given by the
>famous formula wich I dont renember but I am very far from that.
>
>>Leonid.
>
>bye leonid...

I hope you people will talk more about the move ordering, this is the most
painful part of the game to fix.

Your number of nodes seeing in each ply for the middlegame goes well with what I
see in mine. The best average number of nodes that I was able to come was 21%.
This number is the devision between the number of nodes that my logic is forced
to see in each ply devided on number of nodes for given ply.

If it could be interesting my move ordering it goes this way:
1) First moves that put under the fire the ennemy king.
2) Moves with capture put in in four categories. The last capture of the pawn.
3) At the end of the chaine are the moves without any material advantage.

a) Last best move used to be checked against the moves whith best material
advantage. If found, is put at the head of the moves with material advantage.
b) Last 8 best moves are taken from the chaine of the best previous moves and
used to align the moves that give no material advantage.

If somebogy will mention what is the "bubble sort" it will be appreciated.

Leonid.




This page took 0.02 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.