Computer Chess Club Archives




Subject: Re: Move ordering?

Author: Ulrich Tuerke

Date: 14:24:06 04/28/00

Go up one level in this thread

On April 28, 2000 at 17:01:20, Severi Salminen wrote:

>My program finally has AB search, searches some 70 KN/S and it almost knows
>every rule (no underpromotion, 50 move rule and position repetition :-). Now I
>would like to add some move ordering. I have two simple ideas: at root I sort
>the moves by scores from previous iteration

I wouldn't do this because AB will give you only for the pv move an exact score;
for the remaining moves you will in generally get upper bounds, in fact very
often the same value alpha. This does not seem to be a meaningful criterion for
sorting the root moves.


> and at other nodes maybe by
>captures, checks and then others. Does this sound reasonable? Where could I find
>more information on move ordering methods or what do you use?

This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.