Author: martin fierz
Date: 14:59:36 09/22/04
Go up one level in this thread
On September 22, 2004 at 17:15:38, Robert Hyatt wrote: >On September 22, 2004 at 15:57:34, martin fierz wrote: > >>i have a question about root move ordering: my engine currently generates a >>random root move order, and then orders every move that ever fails high to the >>top of the list, with previous best moves slowly going down in the list again. >> >>how do you order your root move list? by number of nodes to refute? or by >>something different? >> >>cheers >> martin > >Initially I do a q-search after making each root move, and use this score to >order the moves at the root. If I am pondering I make sure that the move from >the PV is put first of course. > >After each iteration, I re-order the move list keeping the best move first, and >ordering the rest based on the size of the sub-tree (number of nodes) each >produced when it was searched. don't you think that keeping previous best moves ordered to the front of the list is any good? is the number-of-nodes metric universally accepted as the best or are there other approaches? BTW, if you use that, i don't understand why you bother to order the move list at all at first - in what situation would you not manage to search 3 ply deep (if you manage to search that deep, the intial ordering will have become useless)? cheers martin
This page took 0.03 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.