Author: José Carlos
Date: 16:16:12 12/10/99
Go up one level in this thread
On December 10, 1999 at 13:04:18, Paulo Soares wrote: >Thanks by the explanations to my question in a previous line. >Plus a question: > >" Static evaluation " is the first evaluation of the position for >a program, that is to say the evaluation even before of depth 1. Rigth? >As I could know the value of the " Static evaluation " of a program for >a certain position? > >Paulo Soares, from Brazil Not at depth 0, at any depth you want. The static evaluation is tipally performed at the leaves, this is, at the bottom of the tree, and returned back towards the root. On each "non-leave" node of the tree, you know the evals of all its successors, so you know what is the eval at that node by maximizing the choice. So, static evaluation is the last (tipically) step when "going down" in the tree, and the first when "going up" towards the root. Clear now? I hope so... :) Regards, José C.
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.