Computer Chess Club Archives




Subject: Re: Move ordering?

Author: Dann Corbit

Date: 14:22:24 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 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?

Sort them by time it takes to emerge from alpha-beta.
The ones that take the longest get checked first.  Resort after each new level.

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