Computer Chess Club Archives


Search

Terms

Messages

Subject: [Qu ab. Programming] Does hurt SEE static evaluation?

Author: Oliver Roese

Date: 18:24:02 09/11/99


Dear Chessplayers

I have the following question to the "pro's", regarding
searchextensions:
As far as i have understand it, these extensions
are necessary (at least) to not "fool" the computer into thinking,
it would be best, to simply take a piece with his last move.
I have checked the program "TSCP 1.3", and have found that it
always evaluates the positions, that SEE left behind.
But that introduce another problem (at least i think so), namely
that the computer plays some variant of "Exchange-chess"
at the last ply, to say it drastically.
As a chessplayer i know that this hurts, but i do not know
how much and that is my question.
I provide an example:
White has a pawn on e4 and a knight on d5.
Black has pawns at d6 and e5 and a black bishop.
No other "lightweighted" officers are present.
White has then the advantage of "the strong knight". But if
black is so clever to put its bishop on e7 the computer
will never know that!
Let us now assume the knight is placed on c3. The computer may
know, that he has an advantage, but he would not be allowed
to place his knight on d5...and so on.
As a general rule, "overactive" moves would be punished, whereas "subtle"
moves will keep active pieces active and not trade them with "victims"...
But this is _only_ a theory!
I would like to hear your opinions.

Best Regards
Oliver Roese <oroese@edina.xnc.com>





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.