|
No.1200 |
Original Fairy problems |
Definition: (click to show/hide)
Alphabetic Chess: The squares are considered in the order a1, a2…a8, b1…b8, c1 and so on to h8. At each turn, only the unit standing on the square which comes earliest in this order may move. However check and mate are normal.
|
No.1200 Geoff Foster |
Solution: (click to show/hide) |
|
white Ke3 Rf2 Bb1 Qb4
black Kc1 Pc6c7e7g5
s#11 (4+5) |
1.Bb1-a2 !
1...Kc1-d1
2.Ba2-b3 +
2...Kd1-c1
3.Bb3-a4
3...c6-c5
4.Ba4-b5
4...Kc1-d1
5.Qb4-c3
5...c5-c4
6.Bb5-a6
6...c7-c5
7.Ba6-b7
7...e7-e5
8.Bb7-e4
8...g5-g4
9.Qc3-d4 +
9...c5*d4 #
7...e7-e6
8.Bb7-a8
8...e6-e5
9.Ba8-e4
9...g5-g4
10.Qc3-d4 +
10...c5*d4 #
6...c7-c6
7.Ba6-b7
7...c6-c5
8.Bb7-a8
8...e7-e5
9.Ba8-e4
9...g5-g4
10.Qc3-d4 +
10...c5*d4 #
8...e7-e6
9.Ba8-b7
9...e6-e5
10.Bb7-e4
10...g5-g4
11.Qc3-d4 +
11...c5*d4 # {
The try 1.Be4? Kd1 2.Qc3 c5 3.Qb2 c4 4.Qc3 c6 fails
because the wQ must move. (C+ with Popeye 4.75)}
|