Author: Miguel A. Ballicora
Date: 12:05:52 01/31/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)? > >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? Good observation! Yes, in fact that is how some programs sort their moves at the root. Many will do it with nodes. I do that and it was discussed that Crafty does something like that except the first ply. I do not know if there more, but I guess there is. Regards, Miguel
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.