Original Problems, Julia’s Fairies – 2014 (I): January – April
→Previous ; →Next ; →List 2014(I)
Please send your original fairy problems to: firstname.lastname@example.org
No.485 by János Mikitovics – A miniature for solvers! (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.
Nightrider(N): (1,2) Rider. Operates along straight lines with squares lying a Knight’s move away from each other.
No.485 János Mikitovics
Solution: (click to show/hide)
1.Re5-a5 + Ka3-b4 2.Ra5-h5 Nd8-h6 3.Rh5-a5 Rd6-e6 + 4.Ra5-e5 Nh6-f2 + 5.Ke4-d5 Re6-d6 #
(C+ by Popeye 4.63)
Mutual switchbacks, self-blockad, baby-aristocrat, ideal mate. (Author)
Oscillating moves by bR with double switchbacks are very interesting