Author: Dave Gomboc
Date: 10:33:20 12/17/98
Go up one level in this thread
On December 17, 1998 at 09:39:17, Jürgen Hartmann wrote: [snip] >Moreover I think one of the Chessbase programmers once wrote in a German chess >magazine why they do the game analysis always backwards which looks weird at >first sight: He said its done to let engines which don't clear hash tables take >advantage of 'knowing' the full game continuation which should be a powerful >enhancement of the analysis results. > >Jürgen Hartmann Yes, this is a well-known technique. Some successor positions have already been well-explored, so their assessment is done quickly by reading the hash table. This speeds computation of the assessment of the current position, and because the successor position has been analyzed to a certain depth, in early plies the predecessor position gets a more accurate value backed up to it than if it had searched the successor node itself. Someone is bound to say this better than I did. :-) Dave Gomboc
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.