Awarded Problems
Give a proof game where a piece A intercepts a piece B on 2 different lines. The interception must be used to avoid check or allow castling. Any combination of row, column or diagonal is thematic. Pieces A and B can be of same colour or not. No fairy pieces or conditions are allowed.
0 - Example:
16+15. SPG in 7.0 moves (C+)
[rnbq1b1r/ppp1kppp/4pNn1/8/7Q/3P4/PP1PPPPP/RNB1KB1R]
Solution: 1.Nf3 d5 2.Ne5 d4 3.Nd7 d3 4.cxd3 e6 5.Qa4 Ne7 6.Qh4 Ng6 7.Nf6+ Ke7
1 - Michel Caillaud Messigny 2005 1st price
15+13. Proof Game in 21,0 moves
[rnbq1bn1/ppp1pp2/1kp5/3R3P/5N1P/Q1PP4/PP3PPB/RK4N1]
Solution
2 - Andrey Frolkin & Kostas Prentos Messigny 2005 2nd price
14+12. Proof Game in 14,5 moves (C+)
[2kr3r/ppp2ppp/5Q2/5R1B/3P1n1K/6nP/PPP1Pq1P/RNB5]
3 - Kostas Prentos & Andrey Frolkin Messigny 2005 3rd price
13+13. Proof Game in 18,5 moves (C+)
[1n3bnr/1pp2Bpp/1p1Qp3/4KPr1/8/2P2P1N/PPPNk1P1/4q2R]
4 - Michel Caillaud Messigny 2005 Special price
15+10. Proof Game in 18,5 moves (C+)
[rn3bkr/1pp3R1/Q1p5/p7/2B2p2/2BP1P2/PPP2PP1/RN2K2N]
5 - François Labelle Messigny 2005 1st Honorable Mention
12+16. Proof Game in 7,5 moves (C+)
[rnb1kbnr/pppp1ppp/8/4p3/8/2qQKN2/PPP3PP/R4BNR]
6 - Andrey Frolkin & Kostas Prentos Messigny 2005 2nd Honorable Mention
13+11. Proof Game in 16,0 moves (C+)
[5n2/1RBk1pQ1/3p1rnp/p6p/8/6r1/2P1PPPP/bN2KBNR]
7 - François Labelle Messigny 2005 3rd Honorable Mention
11+14. Proof Game in 6,5 moves (C+)
[rnb1kbnr/ppp1pppp/8/8/8/8/PP1P1P1P/RNB1K1NR]
8 - Vlaicu Crisan Messigny 2005 4th Honorable Mention
16+14. Proof Game in 12,5 moves (C+)
[rnbq2Q1/pppppNrp/3k1n2/6p1/8/2P1K3/PPPNPPPP/R3BB1R]
9 - Anatoly Vasilenko & Andrey Frolkin Messigny 2005 5th Honorable Mention
14+16. Proof Game in 15,0 moves (C+)
[r1bq2n1/ppp1pp2/3p2p1/1Q2nk1p/P1N5/KBrPP3/1PP2PP1/R3B1bR]
There is no order in the Commendations.
10 - Thierry Le Gleuher Messigny 2005 Commendation
15+9. Proof Game in 14,5 moves (C+)
[1n1k1b1r/2R3pq/7n/Q2Kp3/P4P2/3P4/1PPP2PP/1NB2bNR]
11 - ?#8240;tienne Dupuis Messigny 2005 Commendation
12+13. Proof Game in 15,5 moves (C+)
[rn2kb2/pbppP2p/p1N2p2/8/r2P4/3QPP2/PPP2B2/2KR3q]
12 - Göran Wicklund Messigny 2005 Commendation
16+13. Proof Game in 13,0 moves (C+)
[rqbk1bn1/pPp2pp1/n7/3p3p/1B2Q3/NP1P4/3PPPPP/2K1RBNR]
13 - Kostas Prentos et Andrey Frolkin Messigny 2005 Commendation
14+12. Proof Game in 17,0 moves (C+)
[rnb3nr/NpkN2Qp/1q1b4/4ppR1/1B6/1P1P4/2KPPPPP/7R]
by Francois Labelle
To participate I had to write a program to analyze games for their thematic content. Here is the analysis of all the awarded problems. So at a glance you can see which piece intercepted which piece and how many times.
Each triplet is of the form: (number of different lines, piece A, piece B).
I'm counting two interceptions on the same line but in opposite directions as different lines, so for example the 1st prize is scored as intercepting on 4 different lines and not 2.
1st (4,bQd8,wRh1) (1,bPd7,wBf1) (1,wRh1,wQd1) (1,wNb1,bQd8) (1,wPc2,wQd1)
2nd (3,bNb8,bQd8) (2,bNg8,bQd8) (1,bPh7,bRh8)
3rd (2,wKe1,wQd1) (2,bKe8,bQd8) (1,wPf2,bQd8) (1,bBc8,bRa8) (1,wPe2,bRa8)
Spec. (3,bBf8,wRh1) (1,wPd2,wQd1) (1,bPd7,wQd1) (1,wRh1,wBf1)
1st HM (5,wQd1,bQd8) (1,bPe7,wQd1)
2nd HM (2,wPd2,wPa2) (1,bPf7,wQd1)
3rd HM (2,wQd1,bQd8) (1,bPe7,wQd1)
4th HM (2,wNg1,wQd1) (1,wPd2,bBf8) (1,bRh8,wQd1)
5th HM (2,wBf1,bRh8) (2,bNb8,wQd1) (1,bPd7,wQd1) (1,wPe2,bBf8) (1,wNb1,wBf1)
Comm. (3,wRa1,wQd1) (2,wPf2,bQd8) (1,bPd7,wQd1)
Comm. (2,bPg7,bQd8) (1,wBc1,bQd8) (1,wRa1,bQd8)
Comm. (2,bBc8,wQd1)
Comm. (3,wNg1,wQd1)
Of course, proof games shouldn't be evaluated based on this interception data only (it doesn't say if a thematic piece is captured or returns home, for example), but I thought that you'd find this summary interesting nonetheless.
Francois