Author: Ingo Lindam
Date: 09:35:54 12/11/02
Go up one level in this thread
what do we like to optimize when making the decission between possible moves in a current position? eval(move,ply->max)->max in words: decission for the move with best/maximum evaluation within a search tree of growing depth OR eval(move)->max, P(eval(root) is true) -> 1 or eval(move)->max, eval(root) -> correct_eval(root) or eval(move)->max, P(changes in eval(root) -> 0) or eval(move)->max, Q(eval(root))->max in words: decission for the move with best/maximum evalution, where we expand the searchtree in order to maximize the correctness of the evaluation or better in order to make a maximum progress in improving the correctness of the search tree where eval() is the evaluation of the search tree eval(move,ply) is evaluation for a given move depending on number of plys of the searchtree ply is the number of plys root is the current position or root of the search tree x->max means a maximazation of x x->1 means a maximazation of x towards 1 x->0 means a minimization of x towards 0 P(X) means something like the probability/likelihood of case X Q(eval()) means the quality of the evaluation internette gruesse, ingo
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.