Author: Robert Hyatt
Date: 19:01:43 10/12/98
Go up one level in this thread
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.
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.