Author: Bryan Hofmann
Date: 05:01:03 06/15/04
Go up one level in this thread
On June 14, 2004 at 17:35:30, Steve Glanzfeld wrote:
>On June 14, 2004 at 17:18:33, Sandro Necchi wrote:
>
>[...]
>
>>Look this simple answer and think about:
>>
>>1. a !! move is not 100% a sure win; it only give better winning chances most
>> of the time.
>>
>>2. a ! move gives only equality or a small edge in most cases.
>>
>>3. 2 ? moves are good enough to lose!
>>
>>4. a ?? moves is most of the time a loosing move.
>>
>>So we can conclude that:
>>
>>1. to be able to find the best moves in many positions not necessarely makes
>> the program stronger.
>>
>>2. To make several mistakes or weak moves does make the program weaker!
>
>Sorry, I still don't get this. The above is clear to me, but: A good test will
>check if for example how often the ! and !! moves are are found from the test
>set, and how often ? and ?? moves are avoided. Let's imagine we have a program
>which is able to do so very often, while another program can do that much less
>often.
>
>What's wrong now when I say the first program must be stronger than the second?
>
>I don't assume you'd say it doesn't matter if a program finds !/!! move or not,
>or if it avoids ?/?? moves or not :) I thought that's all what chess programming
I give you a prime example as to why this just does not work. A while back I ran
Tao 5.6 through several EPD tests using different seetings to see which one got
the best results. I then ran a few other engines through the same set of tests
with there default settings;
ECM-GCP IQ2 BK Aemis Aemis2 MATS Totals
Tao 5.6 147 175 17 66 46 13 464
Aristartch 4.41 116 163 16 63 51 11 420
Looking at the above results you would say the Tao is stronger then Aristarch
and this is not the case as Tao would only win 35% of the games against
Aristartch.
>is about: Finding the good moves, avoiding the bad moves, more often than the
>competitor can.
>
>Steve
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.