Author: blass uri
Date: 03:05:55 10/13/98
Go up one level in this thread
On October 13, 1998 at 05:54:00, blass uri wrote: > >On October 13, 1998 at 04:34:00, Amir Ban wrote: > >>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? >> >>I've never seen this ending in a computer-computer game where the side with the >>queen failed to win, at any time control. >> >>This endgame is quite easy for a computer. > >Is it easy when the defendor use tablebases? > >I found that the defendor without tablebases(when the defendor is a computer >program) may miss a simple draw by perpetual check in positions when there is >black queen at f2 and white king at h1. Here is an example 7R/8/8/8/8/k7/5q2/7K white to move and draw Fritz5(without tablebases) plays Rg8 and Junior5(16 bit) Rh3+ when Ra8+ is the only way to draw. Uri > >Uri >> >>Amir
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.