Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Mr. Iacovoni's idea: How to program it.

Author: Ilya P. Kozachenko

Date: 06:08:12 08/28/98

Go up one level in this thread



On August 28, 1998 at 08:20:03, Alessio Iacovoni wrote:

>On August 28, 1998 at 07:32:07, Ilya P. Kozachenko wrote:
>
>>
>>On August 28, 1998 at 03:02:02, Alessio Iacovoni wrote:
>>
>>>On August 28, 1998 at 01:18:14, Jeff Anderson wrote:
>>
>>BTW, how you would decide, which move - produced by tactical or positional
>>engine - it's better to select ?
>>It was the point, when discussing of the same idea I posted, finished.
>
>Ok... the tactical engine comes up with it's best line which it believes will
>give it a +0.60. The line (say 10 plies) are passed on to the positional
>"blunder check" engine which determins if that line would bring to a postional
>weakness.. (doubled pawns for example).. if it would, then it subtracts the -
>value of doubled paws (I dont know how much) from the positive value of the
>tactical engine (+0.60 - 0.60 for example = 0 so the line is not satisfactory).
>The process is repeated as many times as possible untill a line is found which
>will reach the highest overall value (tactical and strategical). The
>coefficients could be weighted in such a way as to give more importance to the
>tactics (I would give tactical value at least 50% more importance than
>position... but that has to be decided with trial and error).... In such a way
>very strong tactical lines would pass even though they receive a negative value
>from the blunder check module (a checkmate +99.9 for example would pass
>regardless of the - value attributed by the blunder check module). It seems very
>simple to me.

Yes, it's simple, but there is not the same idea you first  published, it's
other -
and in another words, it is implemented in every chess program ! How, you ask ?

That positional subtraction you propose for, say, doubled pawns
PERFORMED IN EVAL.FUNCTION on each ply and every position and built-in
into final result by minimax itself.
You described another way of doing the same things and I am not sure it would
be better.

But the first idea, as I say earlier, and btw, researched by J.Schaeffer in his
M.Sc. thesis, looks promising and only selection phase is a pin.
Please, read archives of 3-4 August, if not read yet, it will be easier to
understand each other for us.



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.