Original Problems (page 28)
Original fairy problems published during 2012 will participate in the informal tourney JF-2012.
The site is mostly about fairies, but h# and s# are also welcomed for publication! Please send your problems to my e-mail: firstname.lastname@example.org
Go to →List of Problems; →Page 27 ; →Page 29
No.69 – h#3.5** by János Mikitovics – A nice five-men Aristokrat – with two solutions and two set-plays in 3 moves where Black begins. (JV)
Maximummer: Black must play the geometrically longst 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.
You can сlick on “Solutions” to show or hide the solutions!
No.69 János Mikitovics
h#3.5** 2 solutions (3+2)
Solutions: (click to show/hide)
I. 1.Qa8-a6 Sd4-b5 2.Qa6-a4 Sb5-a7 3.Qa4-d1 Kb7-c7 #
II. 1.Qa8-c8 Rd2-d3 2.Qc8-c2 Sd4-b3 3.Qc2-c8 Sb3-c5 #
I. 1…Kb7-b8 2.Qa8-e4 Sd4-c6 + 3.Qe4-d5 Sc6-a7 4.Qd5-a8 + Kb8-c7 #
II. 1…Sd4-c2 2.Qa8-c8 Sc2-e1 3.Qc8-c1 Se1-d3 4.Qc1-c8 Sd3-c5 #
Switchbacks by bQ. (Author)
The diagrams are made on WinChloe and its Echecs font is used for Logo design