No.705 (LK)

Ľuboš Kekely 

Welcome to Ľuboš in Original problems section of JF!


Original Problems, Julia’s Fairies – 2015 (I): January – June

   →Previous ; →Next ; →List 2015(I)

Please send your original fairy problems to:

No.705 by Ľuboš Kekely – Long SAT-play with surprising finals! (JV)


SAT: A King is under check if it can move to at least one square not controlled by the opposite side.

No.705 Ľuboš Kekely

original – 25.01.2015

Solutions: (click to show/hide)

white   kh4 se8 pa6c6f2f6 black kh8 rg8 rh7 pb7f3f4f5f7

ser-hs#10     2 solutions         (6+8)

7 Responses to No.705 (LK)

  1. Kjell Widlert says:

    An echo of a strange s#1 position. It is illegal for Black to move one of his rooks (because that would give a flight-square to the black king), so he is in zugzwang.

    “2 solutions” seems to be missing from the stipulation.

    And is the definition of SAT really correct? I think a king is in check if he can move to AT LEAST one square not controlled by the opposite side ( not “only one”).

    • JuliaJulia says:

      Thank you, Kjell! “2 solutions”, of course, added under the diagram. I’m not sure about what is correct definition of SAT…

    • Actually, I understand position of two black rooks as being pinned as their movement would mean check to black king. A kind of strange pin without pinning piece, based solely on the fairy condition. On the other hand, White can unpin them, by additional attack the sqaure the rooks are blocking.

  2. Nicolas Dupontdupont says:

    Kjell is right. My working definition of SAT is “A King is in check if it can move to a square which is not observed by the opponent side.”

    Of course “a square” means “at least one square” and not “only one square”. This is the way Popeye and WinChloe are understanding the SAT condition.

  3. Seetharamanseetharaman says:

    Interesting “Pickaninny” (?). The other two parts appear as tries!

Leave a Reply

Your email address will not be published. Required fields are marked *

You can add images to your comment by clicking here.