Author: Dave Gomboc
Date: 17:10:17 12/10/99
Go up one level in this thread
On December 10, 1999 at 19:28:38, Fernando Villegas wrote: >On December 10, 1999 at 17:27:46, Bruce Moreland wrote: > >>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 >> >>"Static" means "not moving". The idea is that you evaluate the position without >>trying out specific moves. You can do it at any point in the tree. The typical >>evaluation function is a static evaluation. >> > >Hi bruce: >explain me this, please: except extreme cases of a very unequal position, what >sense has to evaluate something that will not be anymore once a move is done? >seems to me like walking looking behind you how pretty has been the road and an >abyss is waiting your next step. Of course there extensions, etc, but then, >again, what purpose serve the static evaluation If the real thing comes from the >future? >fernando The trick is to stop stepping and evaluate at a place where you're pretty confident that you won't be surprised by what happens when you take your next step. This is what quiescence search is for. Dave
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.