Fairy chess composition
 No.1174  Michel Caillaud  (France) Original Problems, Julia’s Fairies – 2016 (II): July – December      →Previous ; →Next ; →List 2016(II) Please send your original fairy problems to: julia@juliasfairies.com

 No.1174 Michel Caillaud France original – 25.12.2016 Dedicated to Sébastien Luce Solution: (click to show/hide) White Kh8 Qa1 Bc1 Rf5f7 Pa7c7e6e7f4g4g7h7 Black Ke8 ser-==19                                (13+1) 1.c7-c8=S 2.a7-a8=Q 3.Qa8-h1 4.Sc8-b6 5.Sb6-d7 6.Sd7-f8 7.g7-g8=R { } 8.Rg8-g6 9.Kh8-g8 10.h7-h8=B 11.Bh8-g7 12.Qh1-h8 13.Sf8-h7 14.Bg7-f8 { } 15.Qa1-g7{display-departure-file} 16.Rf5-f6 {display-departure-rank} 17.f4-f5 18.Bc1-h6 19.g4-g5 {== (C- ; 9 last moves can be tested by Popeye (Author))} Some reaction to Sebastien's 1163. I was surprised not to find in Winchloé an example without fairy condition. So here it is. I found several ways to do it and choose the setting with more “elegant” solution (a subjective choice of course...) and 4 thematical Pawns on 7th rank in diagram. (I see no interest to add introductory moves such as 1.R5f7 2.Rçf5 3.ç5 4.ç6 5.ç7 diagram). This kind of problem is out of computer-testing range. (at most, 9 last moves can be tested by Popeye). (Author)

Subscribe
Notify of

Inline Feedbacks
Luce Sebastien
December 25, 2016 15:04

Dear Michel,
I am very glad to be a source of inspiration and thank you for the dedicate. This sd==19 without fairy condition is very nice.

Erich Bartel
December 26, 2016 12:06
Geoff Foster
December 26, 2016 22:54

The problem is out of computer-testing range, but it is still possible to check that there is only one way to reach the intended final position. Here is the Popeye code:

pieces
white kh8 qa1 rf7 rf5 bc1 pa7 pc7 pe7 pg7 ph7 pe6 pf4 pg4
black ke8
stipulation ser-a=>b19
pieces
white kg8 qh8 qg7 rf7 rf6 rg6 bf8 bh6 sh7 pe7 pe6 pf5 pg5
black ke8

Popeye takes just a few seconds to confirm that this has only one solution.

3
0