Editing Proof game (section)

== Example problems==
{{Chess diagram| tright
| '''Ernest Clement Mortimer'''<br>(version by A. Frolkin),<br>''Shortest Proof Games'', 1991
|rd|nd|bd|qd|kd|bd|  |rd
|pd|pd|pd|  |  |pd|pd|pd
|  |  |  |  |  |  |  |  
|  |  |  |  |  |  |  |  
|  |  |  |  |  |  |  |  
|  |  |  |  |  |  |  |  
|pl|pl|pl|pl|pl|pl|pl|pl
|rl|nl|bl|ql|kl|bl|  |rl
|Shortest proof game in 4.0.
}}{{Chess diagram| tright
| [[Michel Caillaud]],<br>''Probleemblad'', May/June 1999
|rd|  |bd|qd|kd|bd|nd|  
|pd|pd|  |pd|pd|pd|pd|  
|  |  |  |  |  |  |  |  
|  |  |  |  |  |  |  |pd
|  |  |  |  |  |  |  |  
|  |  |  |  |  |  |  |  
|pl|  |  |  |pl|pl|pl|pl
|rl|nl|bl|ql|kl|bl|nl|rl
|Position after White's 7th move. How did the game go? (2 solutions)
}}
A relatively simple example is given to the right. It is a version by Andrei Frolkin of a problem by Ernest Clement Mortimer, and was published in ''Shortest Proof Games'' (1991). It is an SPG in 4.0. It is natural to assume that the solution will involve the white knight leaving g1, capturing the d7 and e7 pawns and the g8 knight, and then being captured itself, but in fact the solution carries an element of paradox quite common in SPGs: it is the knight that started on b8 that has been captured and the knight now on that square has come from g8. The solution (the only possible way to reach the position after four moves) is 1. Nf3 e5 2. Nxe5 Ne7 3. Nxd7 Nec6 4. Nxb8 Nxb8.

A more complex proofgame, with more solutions, can be seen in the second diagram. The solutions are: 1. b4 h5 2. b5 Rh6 3. b6 Rc6 4. bxc7 Rxc2 5. cxb8=Q Rxd2 6. Qd6 Rxd1 7. Qxd1 and 3. ... Rd6 4. bxc7 Rxd2 5. cxb8=B Rxc2 6. Bbf4 Rxc1 7. Bxc1, showing the Pronkin theme in both solutions (in the first solution with a queen, in the second solution with a bishop).