Author: Heiner Marxen
Date: 15:52:37 12/28/00
Go up one level in this thread
On December 27, 2000 at 04:10:38, Uri Blass wrote: >On December 27, 2000 at 03:03:26, Tania Devora wrote: > >> >> >> >>The combination for find a Mate always are beautiful, I was trying to find very >>difficults Checkmates for the computer programs. I will like to know what is >>the most beautiful Mate or the most Hard Mate to find for the computer programs! > >Here is a hard mate to find for chess programs > >[D]8/p2q4/4pQ2/p2p4/p1pQ1K2/2p2b2/1N1N1n1p/2B4k b - - 0 1 > >Black plays 1...e5+ and say mate in 17 against itself. > >I guess that no program can find this mate in 24 hours but I may be wrong(If you >do not like mate against yourself you can try the position after 1...e5+ and I >guess that again no program is going to see the mate in 17 in 24 hours). > >The solution is: >1..e5+ 2.Kxf3 Qh3+ 3.Kxf2 Qg2+ 4.Ke1 exd4 5.Qf1+ Qxf1 6.Kxf1 cxb2 7.Bxb2 c3 >8.Nb1 cxb2 9.Kf2 a3 10.Nxa3 a4 11.Nb1 a3 12.Nxa3 d3 13.Nb1 a5 14.Nd2 b1Q 15.Nxb1 >a4 16.Nd2 a3 17.Nf1 a2 18.Ng3# > >This is a problem that I composed when the target was to compose the longest >problem when white mate with only a king and a minor piece. > >Uri That is a hard one. In less than half an hour Chest finds mates of depth at most 9 after all other moves, but 1...e5+. After that move there is no mate in 12 (75 minutes PIII/550). I estimate 10 years for the mate in 17. Hence it is more efficient to wait 5 years and use the then current hardware, than to start that computation now ;-) Heiner
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.