Author: Bert Seifriz
Date: 00:24:01 03/14/99
Go up one level in this thread
On March 13, 1999 at 20:24:26, Robert Hyatt wrote: >On March 13, 1999 at 16:56:44, Bert Seifriz wrote: > 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. > Do not forget the time controls after a long game! But some study helps, I agree! Anyway, in fact Karpov and Kasparov had problems. When they got hold of the CDs the first time some years ago, they had a hard time winning, according to an article in CSS. And later GM Nunn wrote another article about the endgame CDs with the title "At the limits of human mind" or something like that where he tried to find some rules for some of the endgames. And he conceded that he did NOT understand a lot of things there!
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.