Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Poll Question ? { Dream Match }

Author: Chris Carson

Date: 16:18:10 01/07/00

Go up one level in this thread


On January 07, 2000 at 18:16:44, Robert Hyatt wrote:

>On January 07, 2000 at 13:59:37, Chris Carson wrote:
>
>>Bob,
>>
>>I know where you stand.  :)  2450 to 2500 is a good number,
>>I completly agree with you and you have posted excellant
>>arguments and facts to support it (both now and in the past).  :)
>>
>>I was not sure if Albert had a different line of reasoning.  I
>>respect his views and was just curious.  :)
>>
>>Best Regards,
>>Chris Carson
>
>
>The issue is 'what will a 2600 player do and what won't he do'.  Today I
>watched Tiger vs Crafty where the game was very equal going into the endgame
>with several pieces left, the only difference is that crafty had a pawn majority
>that would turn into an outside (distant) passed pawn.  The opponent gladly let
>Crafty trade into an ending that was absolutely dead won for Crafty.  A 2600
>player simply would _not_ do that, because it is a trivially won ending...
>
>That is the kind of thing a 2600 player won't do...  and that is something that
>a 2600 player _will_ take advantage of, over and over, when he spots it.
>
>And that isn't picking on Tiger, for any reason other than it is the one at the
>top of the SSDF with a rating near 2700.  You won't find _any_ 2700 player that
>will make a basic mistake like that.  But you will find _lots_ of computers that
>can and will fall into it.

Bob,

IMHO:
2600 players make mistakes, 2700 players make mistakes, 2800 players
make mistakes (I think GK made some against DB).  Sometimes stupid ones.
I have never seen any person play error free for extended periods of
time (person or machine).  I am not skilled enough as
a chess player to point those out, but the colums of chess mags/books
are littered with them.  If I get a chance to locate a mistake by
a top 50 player, I will post it (perhaps a GK vs DB, either match).  :)

I even think GK complained about not having access to DB games (the IBM
team saw this as an advantage in match play) to prepare with.  GK thought
that preparation against the machine would help his performance MPR or
TPR or PR.  :)

I agree with your statements though.  :)  IMHO:  Programs are likley to
make the same strategic error over and over.  Learning solves some of this,
but not all.  This is a major challenge for programmers and programs
and a useful tool for people to use against machines.
Adaptability is a huge hole in programs (among others).  :)

Am I adding anything here or just being stubborn?  If I am not
adding anything, tell me and I will drop it.  :)

Best Regards,
Chris Carson



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.