Author: Robert Hyatt
Date: 08:53:25 05/08/01
Go up one level in this thread
On May 08, 2001 at 10:48:33, Mores Prachaybrued wrote: >Hello, >Could you please explain me the idea behind "order by nodes searched"??? I >can't figure it out.... >Sincerely Yours, >Mark. The nodes searched to evaluate a move at the root is generally proportional to how good or bad that move is relative to the best move at the root. If the move is really bad then the tree search to prove it bad is quite small. If the move is slowly overtaking the best move, iteration by iteration, it's node count will eventually move it to near the top of the list...
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.