Original Problems (page 123)
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 122 ; →Page 124
No.188 – Ser-h=11 by Tibor Érsek & János Mikitovics – Five surprising Rook-promotions! (JV)
Anti-Circe: After a capture the capturing piece (Ks included) must immediately be removed to its game array square (necessarily vacant, else the capture is illegal). Captures on the rebirth square are allowed. Game array squares are determined as in Circe.
No.188 Tibor Érsek & János Mikitovics
Merry Christmas 2012 and Happy New Year 2013!
Solution: (click to show/hide)
1.a2*b1=R[bRb1->a8]! (1.g2*h1=R[bRh1->a8+]?) 2.Ra8-b8! (2.Ra8-a7?) 3.g2*h1=R[bRh1->a8] 4.f2*e1=R[bRe1->h8] 5.e2-e1=R 6.Re1-e7 7.Re7-d7! 8.Kc1*d2[bKd2->e8] 9.c2-c1=R 10.Rc1-c7 11.Rc7-a7 Sa5-b7 =
(Alybadix & Py 4.61)
If minus a) wPb3 or b) wPh3 so the problem has cooks, for example:
The diagrams are made on WinChloe and its Echecs font is used for Logo design