Computer Chess Club Archives




Subject: Move ordering?

Author: Severi Salminen

Date: 14:01:20 04/28/00


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?


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