Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Easy mate

Author: John Merlino

Date: 16:03:41 09/13/03

Go up one level in this thread


On September 13, 2003 at 18:00:18, Rafael Andrist wrote:

>On September 13, 2003 at 14:34:26, John Merlino wrote:
>
>>On September 13, 2003 at 14:31:55, Rafael Andrist wrote:
>>
>>>On September 13, 2003 at 14:08:37, John Merlino wrote:
>>>
>>>>On September 13, 2003 at 10:23:41, Frank Phillips wrote:
>>>>
>>>>>[D]8/4k3/8/8/4Kp1p/5N1N/8/8 w - -
>>>>>
>>>>>Just an amusing position.
>>>>>
>>>>>White to move and win.  Perhaps the longest forced mate my program has played.
>>>>>I was not sure whether it would be caught out by the 50 moves rule.  (Any credit
>>>>>goes to Eugene of course.).
>>>>>
>>>>>It traded down from B+Pawns versus 2N+Pawns to reach this endgame.  My heart
>>>>>sank and I was already to fix yet another evaluation quirk - maybe still need
>>>>>to.
>>>>>
>>>>>Frank
>>>>
>>>>Kxf4 is a forced mate in 90 moves and it will NOT be caught by the 50-move rule.
>>>
>>>No, after Kxf4 it is a draw. You need 51 moves to the next forced capture/pawn
>>>push with best defence.
>>>
>>>Also, I did a short search up to depth 13 and could not find a win which would
>>>not have been prohibited by the 50-move rule.
>>>
>>>The endgame is anyway only won in about 23% of all cases and even then, you will
>>>fail to win it in more than 50% without the appropriate endgame tables.
>>>
>>>regards
>>>Rafael B. Andrist
>>
>>You're probably right, since Black has many options. But can you prove it by
>>posting the moves?
>
>What kind of moves are you interested in? The optimal line of play or optimal
>defense vs. DTM attacker?

Basically, I wanted the information that Dieter provided. Is it possible for
Black to force a 50-move rule draw? Dieter wrote a minimax algorithm that showed
that Black could force the draw. He didn't provide the line, though....

jm



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.