Author: Robert Hyatt
Date: 06:41:30 10/13/98
Go up one level in this thread
On October 13, 1998 at 02:26:39, Dave Gomboc wrote: >On October 12, 1998 at 22:01:43, Robert Hyatt wrote: > >>On October 11, 1998 at 13:41:16, John Coffey wrote: >> >>>Can a program like crafty win KQ vs. KR without tablebases? (Assuming a >>>minute or so per move?) >>> >>>John Coffey >> >> >>Crafty can't... I doubt any program can. Most GM's can't until they >>study it... I was at the ACM event where Browne tried to beat Belle and >>failed miserably several times. He studied it, then at the rematch >>he won easily. But it is non-trivial the first time, and I have had >>an occasional GM get into this ending on ICC and offer a draw immediately. > >I read somewhere (perhaps Karl Marx Plays Chess, by Andy Soltis?) that he didn't >even win it easily, he captured the rook on his 50th move, i.e. he was one move >away from allowing a draw claim. > >Dave Gomboc I think this happened in one of the games in the first match. In the second match he was methodical. A "uscf master" wrote a quite clear and concise way to mate with the KQ side in r.g.c a couple of years ago. Very easy to follow. And it handled "the great flying rook" as the optimal "Belle" defense came to be known...
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.