Author: Robert Hyatt
Date: 06:27:18 10/13/98
Go up one level in this thread
On October 13, 1998 at 02:12:24, Jouni Uski wrote: >In SSDF game archive there is 5834 games. In 21 games there is KQ-KR ending. >And 20 of these were won by Q side WITHOUT any use of TBs! Quite surprising - >isn't this normally considered as difficult ending? *only* if one side has a tablebase. The defense (KR side) has to make some difficult moves, and if it doesn't understand square control, the queen can win. IE another example is KBN vs K. I played many test games using Crafty vs gnuchess, for example, and tuned the bishop/knight code to make this mate not very difficult. Then I tried Crafty vs Crafty, with the losing side having tablebases and it becomes *very* difficult. Ditto for KQ vs KR... but we could try that experiment to see, with Crafty taking the KR side. It would be interesting. On a different note, before I used tablebases, I got into KR vs KN endings three times against "WchessX" and won all three, although this is a dead draw. Some of the defenses are simply too deep to spot with normal search, and the N gets trapped...
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.