Author: Robert Hyatt
Date: 06:43:34 10/13/98
Go up one level in this thread
On October 13, 1998 at 01:53:42, Jouni Uski 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. > >In SSDF big game archive I found about 40 KQ-KR games and for my BIG surprise >all except one were won by Q side and this without any tablebases!! > >Jouni I suspect this is because the losing side didn't have one either. IE we ought to pick a program of your choice (no tablebases) and play it against Crafty with KQKR.* files to see how it ends up. I've seen this ending a few times, from both sides and have not lost one that I watched, where the opponent had no tablebases but had the Q. Winning is very difficult. It is not hard to drive the position to a mate in 20 or so, but there it usually hangs, bouncing from 20 to 23 to 25, slowly back to 20, etc...
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.