Original Problems, Julia’s Fairies – 2013 (I): January – April
Please send your original fairy problems to: firstname.lastname@example.org
No.235 – s#7 by János Mikitovics – A nice fairy 5-men! (JV)
Maximummer – Black must play the geometrically longest move or may choose from among longest moves of equal length, distances being measured from the center of each square. Diagonal and oblique distances are measured from the orthogonal coordinates by using Pythagora’s theorem (take the square root of the sum of the squares of the orthogonal distances). All other orthodox chess rules apply.
KoKo – A move is possible only if the piece moved arrives on a square next to another unit.
No.235 János Mikitovics
Dedicated to Petko A. Petkov
b) Maximummer; KoKo
Solutions: (click to show/hide)
a) 1.Ng8-f6 zz. Rf2-a2 2.Bh5-f3 + Ra2-g2 3.Bf3-e2 zz. Rg2-g8 4.Ke3-f2 zz. Rg8-g1 5.Nf6-b4 zz. Rg1-g8 6.Kf2-f1 + Kh1-h2 7.Nb4-f2 Rg8-g1 #
b) 1.Ke3-e2 zz. Rf2-f8 2.Ng8-e7 zz. Rf8-f1 3.Ke2-f2 zz. Rf1-e1 4.Kf2-f1 zz. Re1-e6 5.Kf1-g1 + Kh1-g2 6.Ne7-g6 zz. Re6*g6 7.Bh5-f3 + Kg2-f1 # (Py 4.61)
Mutual batteries and zugzwangs, self-blockades, selfpin-unpin, Baby-aristocrat. (Author)