| No.973 Ladislav Packa & Daniel Novomeský (Slovakia) |
Original Problems, Julia’s Fairies – 2015 (II): July – December →Previous ; →Next ; →List 2015(II) Please send your original fairy problems to: julia@juliasfairies.com |
No.973 by Ladislav Packa & Daniel Novomeský – Inspired by No.962, orthodox version, with a Happy birthday wishes to Aleksey Oganesjan! (Authors & JV)
|
No.973 Ladislav Packa & |
Solutions: (click to show/hide) |
|
white Kd7 Qe7 Sc7 Rb5 Bc1h3 Pa5d2c5d6e5f2f3f7
black Ka3 Rb2 Bh1 Pa6a7c4d3e6f5
hs#5 b) +bRh1 (14+9) |
Thank you for the dedication – Ladislav, Daniel and Julia!
The problem is nice! If the authors were managed to do hs#5.5 with adding 1…h1R and 1…h1B then it will be even more attractive! But – in view of big overcome technical difficulties! – it is fortunate that this hs#5 is correct, legal and succefull!
Yes, the promotion in HS#5.5 was the original idea. But Mother Nature was against us, after promotion to bQ put us too many obstacles in the way.
The zugzwang finales remind me of the following problem, which has AUW!
Michel Caillaud, 1 Prize, 3rd Tzuica Ty, Eretria 2005
White Kc5 Rc6 Rc1 Bb5 Bb4 Sf4 Pa5 Pd5 Pd4 Pe3 Pf2
Black Kh2 Pf6 Pf5 Pa2 Pb2 Pc2
hs#4.5 2.1.1…
1…a1=Q 2.Rd6 Qa2 3.Bc6 Qxd5+ 4.Kxd5 b1=B 5.Bc5 Ba2#
1…b1=R 2.Bc3 Rb4 3.Bd3 Rxd4 4.Kxd4 a1=S 5.Rc4 Sb3#
C+ by Gustav 4.2a 64 bit Brute force Hashtables 20GB – solving time 49 minutes
( position a – 14 minutes, position b – 35 minutes)