Author: John Coffey
Date: 22:39:47 01/03/02
There has been some confusion in my mind for years about move ordering. I know that good move ordering will reduce the size of the tree. How important is it to get all the moves in the best order as oppose to just starting with the best candidate? For example, I read that some programs generate the entire move list, and then scan through the list to find the move with the best score (by some criteria such as the value of captures) and then rescan the list when it is time to try the next move. Both this scheme and sorting seem very time consuming to me because we could be talking about N^2 compares. Cutoffs will reduce the time a great deal. If you start with a move from the hash table/transposition table, then how important is it to order the remaining moves? If it weren't important, then you wouldn't have to generate the entire move list, but as I understand it, most programs generate the entire move list anyway? I think that Crafty does. John Coffey
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.