Original Problems (page 134)
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 133 ; →Page 135
Warm welcome to Arnold Beine – famous German problemist and also an editor of fairy section of world-famous German magazine Die Schwalbe!
No.204 – h#5,5 by Arnold Beine – An interesting action of the neutral Pawns-trio! (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 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.
No.204 Arnold Beine
h#5,5 b) Kd4→d6 (1+1+3)
Solution: (click to show/hide)
a) 1…g8nB (1…g8nQ?) 2.Kc3 Kb5 (tempo) 3.Kb2 f8nB (3…f8nQ?) 4.nBa2 nBg7 5.nBg8 f7+ 6.Ka3 f8nB# (7.nBxg7? [+nBc1]!)
b) 1…g8nS 2.nSe7 fxe7 [+nSb8] 3.nSd7 Kb4! (3.nSc6+? Kb5?) 4.nSe5 f8nQ 5.nQf1 e8nQ 6.nQff7 (6…nQff8?) nSxf7 [+nQd8]# (7.Sxd8? [+nQd1]!)
For those, who expect an AUW, there is also a third solution, but then they have to accept a move-repetition (f8nQ): c) nPf6->d6: 1…g8nQ 2.nQa8+ (nQg1?) 2…nQc8 3.nQh3 f8nQ 4.nQhc8 d7 5.nQa3+ nQe3+ 6.nQee8 d8nR# (7.nRxnQ? [nQd1]!) (Author)
The diagrams are made on WinChloe and its Echecs font is used for Logo design