Awarded Problems
This composition tourney was held during the 21st RIFACE (an annual French meeting for chess composition enthusiasts) in Messigny, 2000. The tourney asked for "proof games with as many checks as possible".
Awarded by Thierry le Gleuher.
1 - Michel Caillaud Messigny, 2000 Price
12+15. Shortest proof game in 24,5
[1n1kb2q/pKpR1pr1/p1p3p1/6p1/3P2n1/3r1P2/PP1P1bPP/RNB5]
Solution
2 - Peter Van Den Heuvel Messigny, 2000 Honorable mention
15+14. Shortest proof game in 19,0
[4n2r/1p1pk1pp/8/bp1Kpp2/7N/1np4P/P1PPPPqP/RNBQ1R1B]
3 - Bruno Kampmann & Marion Kerhuel Messigny, 2000 Honorable mention
15+9. Shortest proof game in 11,0
[7r/pp1pp1Qp/2p5/8/4k2K/2P4r/PP1PP1PP/RNB2BNR]