Author: Robert Hyatt
Date: 11:55:16 01/27/03
Go up one level in this thread
On January 27, 2003 at 12:35:50, Georg Langrath wrote: >I tried to let Chessmaster 9000 play against itself in endgame KRKQ. The side >KR with tablebases and the side KQ without. KQ-side wasn’t nearer checkmate in >move 50 than in move 1, even with 3 minutes per move. It is rather amusing to >look at. I think that it is impossible for a computer to solve without special >knowledge or tablebases as in the case KBNK. >Georg Then chessmaster has a problem. I'd be happy to play you with Crafty using no tables, with the KQ side, against a program using the tables with the KR side. I ran this test about a hundred times a few years ago when Amir first reported that Junior could win KQ vs KR without tables. I didn't believe it, but found that it was not only true, but trivially true. I managed to win with only one second of computing per move. I can run some tests and post the pgn if you want...
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.