mcaillaudNo.1174 
Michel Caillaud 
(France)

JF-LOGO-1

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)


Subscribe
Notify of
guest
3 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Luce Sebastien
Luce Sebastien
3 years ago

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.

Geoff Foster
Geoff Foster
3 years ago

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.