Author: Christophe Theron
Date: 18:10:02 04/08/98
Go up one level in this thread
On April 08, 1998 at 20:28:05, Fernando Villegas wrote:
>On April 08, 1998 at 15:54:49, Edward Screven wrote:
>
>>On April 07, 1998 at 23:01:40, Fernando Villegas wrote:
>>
>>>My impression was and is this: that CSTAL not only make good use of a
>>>far great knowledge code than other programs, but besides, and maybe
>>>more important, it makes use of a search technique very different to the
>>>well known Maximin kind of search, where in each node the program pick
>>>up the moves that gives the lower rating -or the less high- to his
>>>rival.
>>>It’s my impression that CSTAL uses a search technique where the purpose
>>>is, inside certain limits, to get moves that produces maximal pressure
>>>for the adversary and not the minimal score for his best available move.
>>> That “maximal pressure” would be equal to get a maximal number of
>>>threats and dangers for the rival even at the cost, some times, to let
>>>one or more candidate moves that, if picked up, surpass the maximin
>>>standard approach.
>>
>>or perhaps CSTAL uses a conventional search algorithm coupled with
>>an evaluation function that includes large terms for threats.
>
>
>
>Well, if that happens then is not anymore maximin approach, doesn't it?
>F
>> - edward
What you describe can be achieved by a "classic" minimax approach. As
far as I know, Chris Whittington did not claim he had a new search
algorithm, but he did claim that his evaluation was different.
CSTal behaviour could be the effect of a non-minimax algorithm, but not
necessary. Maybe Thorsten can shed some light on this? Without betraying
Chris secrets, of course.
Christophe
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.