Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Troitzky 1912 ultimater? ...

Author: Dann Corbit

Date: 16:42:55 06/15/01

Go up one level in this thread


On June 15, 2001 at 12:40:18, Jim Monaghan wrote:

>On June 15, 2001 at 10:00:37, Uri Blass wrote:
>
>>On June 15, 2001 at 09:36:58, Jim Monaghan wrote:
>>
>>>First of all let me say that the book does not give the solution.
>>>
>>>[D] 8/P1k2P2/6q1/N2K4/2n3N1/7p/8/8 w - - 0 1
>>>
>>>This position (White to play and win) is given as a curiosity. In the original
>>>edition there was a fantastic solution almost 4 pages long - a real labour of
>>>love on Troitzky's part. This solution has been omitted in the present edition,
>>>since any attempt to solve the ending would only result in failure and
>>>frustration for the unhappy would-be-solver. (Fred Reinfeld, editor)
>>>
>>>So I don't have the answer guys, but it's probably even harder than the other
>>>one posted earlier.
>>>
>>>Cheers,
>>>Jim
>>
>>After a8N+ Kd7 f8N+ white can get 4 knights for a queen and 4 knights seem to be
>>stroger than a queen.
>>
>>Uri
>
>Right Uri. It's rather cheap that the editor just hacked the solution out of the
>book. Publishers should give their readers more credit.
>
>So the solution is a tablebase win then. KNNNNvsKQ ... a 7 piece tablebase? I
>have only heard of 6 man ones. Are there such things as 7 man? That extra piece
>would add a pile of analysis.

Or it might slow it way down.  Try seeking through 100TB of disk with today's
hardware.  It might be faster to compute the moves on the fly.  Especially since
there are still pawns on the board.




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.