Author: Robert Hyatt
Date: 17:24:26 03/13/99
Go up one level in this thread
On March 13, 1999 at 16:56:44, Bert Seifriz wrote: >Well, why make so much noise about a well known fact???? You know it, >everynbody knows it, why do you even care to discuss??? >I would not go into deep psychology or any far fetched explanations! >The facts are clear and without any doubt: nobody wants to lose! >And all Grandmasters are very likely to lose against computers in all stages >of the game. >To give only one example: As far as I know GM Kasparov is not able to >win with a Queen against a Rook when you use Ken Thompson's endgame >tablebases. Of course the position should not be mate in one of course, >but let us take just a position with mate in 27, for example, which >is quite a common thing. >Well believe it or not, neither Kasparov nor Karpov can win. They are >helpless! > this isn't true, most likely. IE when Ken first did KQ vs KR, he played a series of games vs Belle and couldn't win with the Q. But he went away, studied it a bit, and when he came back he had no problem winning. Even a computer, with no tablebases, can win this with just a few seconds per move, which is surprising. I'd bet Kasparov or Karpov would have no problems with this ending... most GM's probably wouldn't. >And yes, a Porsche is somehow faster than the last Marathon winner, >but Porsches are not allowed in any Marathons race! So what?
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.