Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Distributed Evaluation Functions

Author: Vincent Diepeveen

Date: 01:34:27 07/21/00

Go up one level in this thread


On July 19, 2000 at 20:37:45, Hugh Cumper wrote:

>The chess programs I have seen evaluate every position as if the pieces had just
>been set up that way. Humans do not work like that nad I see no reason why

Dead wrong. Real strong GMs work that way. They play real objectively and
look to how the position is.

Just not the way they search the possible lines works way smarter.

>programs should. Most of the work in an evaluation function relates to
>individual pieces - its value, whether the square it is on is in general a good
>one for that rype of piece; or a small cluster of pieces - whether a pawn is
>isolated, doubled etc. Most moves do not change these things for an arbitrarily
>chosen piece so why work it all out again each time? The evaluation functions
>could be distributed around the move generation and search code which would

I think i'm misreading the word 'distributed' here. But it sounds like
a hell of a lot nonsense.

>maintain running totals. This would require a form of evaluation to be performed
>at all nodes not just terminal ones but overall it would be more efficient. Has
>anyone done this, or can someone explain why?



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.