Author: Roy Eassa
Date: 11:52:46 01/31/02
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)? 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.01 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.