Author: Marc D
Date: 15:30:26 04/27/05
Go up one level in this thread
On April 27, 2005 at 17:28:26, David Dahlem wrote: >On April 27, 2005 at 17:13:05, Tord Romstad wrote: > >>On April 27, 2005 at 16:49:28, Kevin K wrote: >> >>>Is there dynamic evaluation? >>>And if it is, what is dynamic evaluation? >> >>The word "static" in chess programming terminology usually >>means "calculated without doing a search". The static evaluation >>is the evaluation the program assigns to a position by just looking >>at the current position, without moving the pieces around on the >>internal board. >> >>Two other typical examples of the word "static" are "static >>exchange evaluation" and "static pruning". Static exchange >>evaluation is a technique programs use to calculate the expected >>gain or loss in material of a capture move without actually making >>the move. A simple computation is done based on the pieces >>which attack and defend the captured piece. Static pruning >>is a name for pruning techniques where the program decides >>that certain moves or positions are not worth investigating, >>without doing any verification search. There are also dynamic >>pruning techniques, like recursive null-move search. > >Are there any papers available online about "static pruning" techniques, or do >you know where i can find more info on this topic? > >Thanks >Dave > Hi Dave Maybe on this site you find what you are looking for http://members.home.nl/matador/chess840.htm Marc
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.