Author: William Bryant
Date: 17:00:39 01/18/99
When a position is evaluated with a score that is > than alpha, that position then replaces alpha, and gets stored in the hash table as an EXACT score. If this move is the move backed up to PV[ply][ply], is the 'Best Move' that is stored in the hash record the move at PV[ply][ply + 1]; ie the next move to take from this position? If it is, then when getting a hash table hit, with an appropriate draft, is the best move then used as the move to search next by returning it to the pv at the position PV[ply][ply + 1]? This is a rudementary understanding of the best move. Explinations, Clarification, and Examples would be apprediated. william wbryant@ix.netcom.com
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.