Author: Robert Hyatt
Date: 20:42:44 09/22/04
Go up one level in this thread
On September 22, 2004 at 21:58:22, James Swafford wrote: >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. > >Why the initial q-search if you're going to resort after a 1-ply >search anyway? Does it really help? > > I use the initial scores to detect "easy moves". q-search is more accurate than trying SEE... > >> >>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.
This page took 0 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.