No. 151, February 1995
R1 - Caillaud, Michel Problemkiste, 08/1994
9+16. Shortest proof game in 9.5 moves (Andernach chess)
13+16. Shortest proof game in 13.0 moves
8+16. Mate in 4
8+1. Add one piece and then mate in 1. How many solutions?
12+13. Last 26 single moves?
16+10. Add the bl. King so that he is checkmated
10+12. Least number of Queen moves?
15+10. Shortest proof game in 20.5 moves
16+16. Shortest proof game in 34.0 moves
5+10. sh#1 (3 Solutions) Auxiliary question: why not h#1?
0+62. (a) Replace all 62 Bs by two (fairy) men, so that there is the same number of variations in a seriesmover! (b) Which mathematician could give his name to these variations?