Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: An amazing checkmate. Can your program find it?

Author: leonid

Date: 16:07:49 12/22/99

Go up one level in this thread


On December 22, 1999 at 18:04:38, Chessfun wrote:

>On December 22, 1999 at 17:51:22, leonid wrote:
>
>>On December 22, 1999 at 14:10:56, Dann Corbit wrote:
>>
>>>Have a look at this tremendous checkmate Chest found from the famous 1924 New
>>>York Chess Club championship:
>>>2r3k1/5ppp/7r/Q7/3P1p2/1N3Pnq/PP3K1P/R5R1 b - - acd 10; acn 535351375; acs
>>>15279; bm Ne4+; ce 32750; dm 9; id "C.A.P. 812153"; pv Ne4+ fxe4 Qe3+ Kf1 Rxh2
>>>Rxg7+ Kxg7 Qe5+ f6 Qe7+ Kg6 Qxf6+ Kxf6 e5+ Kg6 e6 Qf2#;
>>>
>>>I will be amazed if any general purpose program (or even most GM's) can find it.
>>
>>My mate solving logic will impecably solve every mate related problem, never
>>mind how difficult it can be. Question is only in the time. Beyond 16 plies it
>>can take too long to solve certain position. Do you have somewhere this
>>position, that you mention, in graphics? Feel me somewhat curious to try it.
>>
>>Leonid.
>
>There I am thinking it's Christmas when it is April Fools day lol.
>Thanks.

Ready to verify with everyone if this is true. Logic will find in 100 not known
in advance positions, with 100% precision inevitable mate. Minimum number that
lead to mate, and all moves if more that one existe for that position.

Leonid.



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.