Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Chess Tiger - Is It Really 2696 ELO?

Author: Albert Silver

Date: 12:07:42 12/22/99

Go up one level in this thread


On December 22, 1999 at 14:01:43, Graham Laight wrote:

>On December 22, 1999 at 10:00:07, Robert Hyatt wrote:
>
>>>We firmly believe that our ratings are correct in the sense that if a computer
>>>were to play a sufficient number of games against Swedish humans, it would end
>>>up with a rating close to what it has on our list. Unfortunately, as programs
>>>get better it becomes increasingly difficult to arrange meaningful games against
>>>human players. Reassuringly, we've noted that our ratings are fairly consistent
>>>with the results from the yearly Aegon tournament in Holland.
>>
>>
>>Baloney nowadays.  No program would consistently play at near 2700 at
>>aegon.
>
>I respect your point of view as an experienced and practising computer chess
>person. However, I feel compelled to ask: have you any evidence to support this
>assertion? If not, why do you think it is so?
>
>At the end of the day, good chess is good chess. A machine that can beat more
>computers is also likely to beat more humans.
>

That's really the core of the issue, and I don't agree with it. I used to, but
as I grew stronger in chess, I changed my mind. It isn't because I am way up
there, but because I can better appreciate the difference between myself and an
IM for example. The point is 80-90% of computer chess is dependent on tactics,
and let's say up to a strength of 2100-2200, this is also very true for human
players, but then a new important factor comes in and the balance swings
completely. Most IMs and GMs rely on their positional play, and this weighs in
more and more as a rule the stronger they get. This is not the case of computer
programs. Not by a long shot. And since no program is sufficiently strong
positionally to properly compensate inferior tactics with superior positional
play, the tactical wizards consistently top the lists.

Finally, A beats B, and B beats C, does not mean that A beats C. To find out if
A beats C, pit it against C and find out.

                                   Albert Silver

>Graham



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.