Original Problems (page 137)
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: email@example.com
Go to →List of Problems ; →Page 136 ; →Page 138
No.207 – h#5 by János Mikitovics – Nice opus with 2 e.p.! (JV)
Circe: Captured units (not Ks) reappear on their game-array squares, of the same colour in the case of pieces, on the file of capture in the case of pawns, and on the promotion square of the file of capture in the case of fairy pieces. If the rebirth square is occupied the capture is normal.
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.
No.207 János Mikitovics
Dedicated to Arnold Beine
h#5 2 solutions (1+1+3)
Solution: (click to show/hide)
I. 1.Kc6-b7 Ke4-d5 2.Kb7-a8 Kd5-c6 3.nPd3-d2 Kc6-c7 4.nPd2-d1=nS nSd1*b2 [+nPb7] + 5.nPb7-b5 nPc5*b6 ep. [+nPb7] #
II. 1.Kc6-b5 Ke4*d3 [+nPd7] 2.nPd7-d5 nPc5*d6 ep. [+nPd7] 3.Kb5-a4 Kd3-c4 4.nPb2-b1=nR nRb1-e1 5.nRe1-e8 nPd7*e8=nQ [+nRa8] #
[En passant 2x] (Author)
The diagrams are made on WinChloe and its Echecs font is used for Logo design