Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Are there any engines with a dynamic parameter algorithim

Author: Mike Hood

Date: 05:42:12 10/17/05

Go up one level in this thread


On October 17, 2005 at 08:03:49, Vladimir Medvedev wrote:

>
>>I was thinking why not have an algorithim that can recognize certain aspects of
>>the position and then accordingly change parameters "on the fly".  For example
>>in the opening it would use certain parameters, then when the position becomes
>>dynamic again a change in parameters, if both bishops are on again another
>>parameter.
>
>A brilliant idea: when position is good algorithm should evaluate it as good,
>and when position is bad, it should be evaluated as bad. I wonder why no chess
>programmer implemented this simple approach during 40+ years of chess
>programming...

The problem with this approach is: apart from very general classifications
("opening", "middlegame", "endgame") it would be necessary to build the position
recognition and parameter alteration into the algorithm in order to analyse a
position. And if a position is recognized, why not just add a positional offset
point or two to the evaluation rather than alter the parameters? Even obvious
positional criteria such as passed pawns aren't as clear cut for parameter
changes. There may be a passed pawn on the board now, but it could be gone after
6 plies into the search.

I'm not saying that the dynamic parameter approach is impossible to implement.
All I'm saying is that this approach would probably lead to an overall weaker
engine.



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.