Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Move Ordering at the Root

Author: Will Singleton

Date: 20:58:07 09/15/99

Go up one level in this thread


On September 15, 1999 at 23:26:29, James Swafford wrote:

>I've never really understood the importance of root ordering.
>If you resort the move list after every ply, then the (initial) root
>ordering is useless after the first iteration.
>
>--
>James

Right, but that's one of the advantages of iterative deepening.  Might as well
reorder the root moves based on latest info.  Can't hurt.  Or can it?  Depends
on how good your initial sort is, if you use a special root eval, I guess.  But
in a tactical situation, if your root order is bad, and you don't re-order based
on node-count, then you'll waste time searching crummy 2nd and 3rd moves, etc.
Or will you?  Hmm...

btw, did you ever do the eval parameter learning project?

Will



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.