Problem 123: Paul Raican - Fairy (AntiAndernach, Maximummer) |
a) 1.e7-e8=bQ! Qe8-e1=wQ 2.Kf2-e2 Kh2-g1 3.Rf4-f5=bR Rf5-a5=wR 4.Qe1-a1=bQ Qa1xf1# b) 1.e7-e8=bR! Re8-e1=wR 2.Rf4xd4 Kh2-h3 3.Kf2-g1 Kh3-g3 4.Rd4-d3=bR Rd3-d8=wR 5.Rd8-e8=bR Re8xe1# c) 1.e7-e8=bQ! Qe8-e1=wQ 2.Qe1-b1=bQ Qb1-g6=wQ 3.Qg6-d6=bQ Qd6-a3=wQ 4.Kf2-e1 Kh2-g1 5.Qa3-a6=bQ Qa6xf1#
Anti-Andernach Chess: a unit (not King) changes color after its moves unless that move is a capture. 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. |
KOBULCHESS.COM
site for chess composition
General editor:
Diyan Kostadinov
Co-editor:
Seetharaman Kalyan
Comments
I agree, as "a" repeats and the first and last moves of part-C
I agree as the first move and last move of Part c and a are same.
I think it is impossible zeroposition to be avoided without using part a) in this setting.
RSS feed for comments to this post