DRAWN PROOF GAMESThis page contains some proof games with a difference. Proof games are explained here, more or less, but in most of the problems on this page, there is an additional piece of information: namely that the game has just ended in a draw. Could the draw have been by agreement? A rarely-used convention is that in a chess composition, the players may not agree a draw, in the same way that no player may resign in a chess composition. For an example, see ???. [1] So the draw must have been by some other mechanism, not hard to find. {A}-{I} are just appetizers, with {I} the shortest and best. {J}-{L} extend the idea of {H} & {I} to slightly more complicated positions. Then follow some related earlier problems by other composers, {M}-{O}. {P} offers the same kind of stipulation, but with a full proof game.
Peter van den Heuvel & Joost de Heer pointed out to me two earlier problems from 1997. The first appearance seems to be in 1996, but is known to be cooked, and is beyond my wit to repair. {P} is my offering along the same lines.
{Q} addresses a theoretical issue discussed on the solutions page.
[1] If resignation were permitted, then all self-mates, direct stalemates, self-stalemates and arguably all direct mates would be cooked. There are only a few compositions which would be cooked by players agreeing a draw, but I follow the convention adopted by Michel Caillaud. Another example is the joke problem ???. Neither convention appears in the Codex. |