Author: Dieter Buerssner
Date: 10:58:10 11/24/02
Go up one level in this thread
On November 24, 2002 at 13:21:16, Roy Eassa wrote: >On November 24, 2002 at 07:43:30, Eric Gallula wrote: > >>Hello All, >> >>Just a problem presented by IM Aldo Haik in the french newspaper "Le >>Figaro"(Feb 12th 1999). >> >>Very strong. >> >> >> >>White to play and win: >>---------------------- >> >>White: >> >>King d8,Bishops b3 and g1 >> >>Black : >> >>King c1,bishop a1,pawns b2,b6,b7,h7 >> >>Solution: >>1 Be3+ Kb1 >>2 Bh6! b5 >>3 Ke7 b4 >>4 Kf6 b5 >>5 Kg5! Kc1 >>6 Kf5+ Kb1 >>7 Kf4 Kc1 >>8 Ke4+ Kb1 >>9 Ke3 Kc1 >>10 Ke2+ Kb1 >>11 Bd2 h5 >>12 Kd1 h4 >>13 Bxb4 h3 >>14 Bd5 h2 >>15 Kd2 h1Q >>16 Bxh1 Ka2 >>17 Bd5+ Kb1 >>18 Ba3! b4 >>19 Bb3 bxa3 >>20 Bg8 a2 >>21 Bh7 Mat >> >>Greetings, >>Eric > > >There's a shorter mate!: > >1.Be3+ Kb1 2.Bh6 b5 3.Ke7 b4 4.Kf6 b5 5.Kg5 Kc1 6.Kf5+ Kb1 7.Kf4 Kc1 >8.Ke4+ Kb1 9.Ke3 Kc1 10.Kd3+ Kb1 11.Bg8 b3 12.Bxb3 b4 13.Bg8 b3 >14.Kc3 Ka2 15.Bxb3+ Kb1 16.Be3 h5 17.Bf7 h4 18.Kb3 h3 19.Bg6# Roy Eassa in a different thread: "I doubt that ANY program on a PC can find this entire combination from scratch in a reasonable amount of time." I believe, here it is really the case for normal playing engines. Although some clever extensions could make a program find this. Perhaps proof number search, too? Yace needs about 9 moves into the line (forgot the exakt number) to find a mate in some time. But when going back fast, I get a mate score at the root (mate in 19 with the line you gave). This shows, that the variations is very forced (otherwise it would need more analysis while going back). Regards, Dieter
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.