Author: Bruce Moreland
Date: 09:13:21 10/13/98
Go up one level in this thread
On October 13, 1998 at 09:31:00, Robert Hyatt wrote: >It might be easy against an opponent with no tablebases, but when the >opponent has perfect info, it is non-trivial. Again, I'd be happy to run >the experiment with someone to test whether a program can beat a tablebase >in 50 moves or not. So far, I haven't personally seen one that can. I >have such endings with three different programs, CSTal, Rebel 8 and gnuchessX >and when Crafty had the R side, all were were draws, when it had the Q side >it won every time because it did use the databases... Why did Crafty allow KQ vs KR against any of these? Didn't it see this as a forced mate and try to do something to avoid getting into it? The only time I can remember being on the weaker side of KQ vs KR was one of the rare cases that really is drawn (queen stalemates my king, so my rook goes wild checking their king from one square away). bruce
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.