Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Evaluation/search question

Author: Robert Hyatt

Date: 12:35:14 01/11/00

Go up one level in this thread


On January 11, 2000 at 15:31:36, Dan Andersson wrote:

>I am considering giving some kinds of root moves penalties because they do
>nothing to improve a position. For example sometimes my search returns a
>checking move, followd by retracting the piece to a square that it could have
>moved to directly, that only postpones the bad variation and essentially hides
>it from search at the cost of one tempi. Another penalty Im considering is
>against pawn moves at root position, as Nimsowitch said 'All pawn moves, are
>mistakes'. The penalties sould not be to severe I think, in the range of 1/10th
>pawn or so. Anyone tried it before? Any critique and idea are welcome. The
>rationale is that if the move is really good or forced it will be played anyway.
>
>Regards Dan Andersson


Note that this is not easy to do.  Because if you give the bonus at the root,
it affects the score at the tips of the tree below that root move.  And thanks
to the hash table, you can now play the move at ply=3 at the root, and the
root move at ply=3, and the hash table will politely include the original bonus
due to the way hashing is about positions, not moves.



This page took 0.01 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.