Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How many moves to mate in this curious position?

Author: Paulo Soares

Date: 12:33:38 08/21/00

Go up one level in this thread


On August 21, 2000 at 07:22:25, Uri Blass wrote:

>On August 21, 2000 at 05:13:55, Paulo Soares wrote:
>
>>On August 20, 2000 at 05:33:26, Helmut Conrady wrote:
>>
>>>[D]6bn/2k2prq/5prp/5pbn/5p1p/1Kp2PpP/2P3P1/8 w - -
>>>
>>>Some time sago this postion appeared in a computer magazine. Unfortunatelay the
>>>solution was not given. Who can help and give me the moves?
>>>
>>>Thanks!
>>>
>>>Helmut
>>>
>>>My WM-Tip:
>>>
>>>1. Shredder
>>>2. Rebel
>>>3. Fritz
>>
>>I tried to find a solution for this position but I didn't get. Although I think
>>that it is a draw, I was curious. You could send an email for the magazine to
>>know if some mistake there was been in the problem.
>>I remember a checkmate in 10 moves in that the author placed 1 piece in wrong
>>position and, obviously, I didn't get to solve the problem. During almost 10
>>years (!), with varied intervals of time, I tried to solve the position without
>>success. There are 3 years, I discovered that the initial position was incorrect
>>and finally I could find the solution.
>
>
>You are right that the initial position is not correct.
>
>Here is the right initial position
>6bn/5prq/5prp/5pbn/5pkp/1Kp2PpP/2P3P1/8 b - - 0 1
>
>The position is of course illegal but the author of this position probably does
>not care about it.
>
>Uri

With this position you are affirming that doesn't like to analyze impossible
positions. I don't have any restriction to the position that I analyze.
I don't doubt that  programmers analyze impossible positions
to test the programs.
There are some years ago I used the position below to know
which the maximum depth that a program calculated.

Paulo

[D] 8/1p6/bp6/kp6/1p6/1p1p1p2/1P1P1P2/1K6 w - - 0 1




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.