Author: Sanjiv Karnataki
Date: 19:57:08 03/08/00
Hi, I noticed that in crafty all moves except the first move in the root move list are sorted by the node count so that after the best move from the previous iteration all other moves are in a descending order of node count searched in the previous iteration? Am i correct in reading the code? and what is the advantage of doing this? Currently in my program, I keep the root move sorted based on the score returned for each move from the previous iteration. highest score to lowest score. what are the pros/cons of this method vs. crafty's? Thank you in advance. Sanjiv.
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.