Author: John Coffey
Date: 10:56:49 03/01/00
The transposition table will tell us if a move is more desired than the other moves. So will iterative deepening and iterative iterative deepending. In both cases it seems necessary to sort the moves from most prefered to least prefered. What is the method for doing this? Is it just a standard sort routine? When doing move generation on a position that we haven't seen before, could we do things like sort captures to the top of the list, especially when a more valuable piece is being captured. John
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.