Author: Alvaro Jose Povoa Cardoso
Date: 11:30:12 02/01/02
Go up one level in this thread
On January 31, 2002 at 14:52:46, Roy Eassa wrote: >Would it make any sense to rank (i.e., order) moves for examination at ply x+1 >by how long they took to examine at ply x (most to least)? In the context of iterative deepening you can order the moves at the root by the time or then subtree node count they took at the previous iteration. But only at the root (I presume that by _ply_ you mean _iteration_). At anywhere else in the tree I don't see how that can be done. It simply doesn't make sense. Alvaro Cardoso >I saw this because I often see a chess program spend a LOT of time on a move at >a given ply (sometimes because it's actually the correct move), yet still rank >that move very low for examination at the next ply. If it had to spend so much >longer than higher-ranked moves, there must be something significant going on, >no?
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.