OzProblems
Australian Chess Problem Composition
Welcome to OzProblems.com, a site all about chess problems in Australia and around the world! Whether you are new to chess compositions or an experienced solver, we have something for you. Our aim is to promote the enjoyment of chess problems, which are at once interesting puzzles and the most artistic form of chess.
An in-depth introduction to the art of chess composition, examining various problem types and themes.
The weekly problem’s solution will appear on the following Saturday, when a new work is quoted.
See last week's problem with solution: No.695.
Prominent Australian problemists write about their involvement in the contemporary problem scene, and present some of their best compositions.
A comprehensive collection of Australian chess problem materials, including e-books, articles, magazines and columns (all free downloads).
A chess problem blog by Peter Wong, covering a range of subjects. The main page provides a topic index.
See latest post below, followed by links to other recent entries.
Use the contact form on the About page to:
Comment on a Weekly Problem you have solved.
Subscribe to OzProblems updates.
Ask about any aspect of chess problems.
Walkabout
Capture-free proof games
10 Mar. 2024
In proof game problems, the objective is to find the precise sequence of moves to reach the diagram position, starting from the standard array. Because the problem position comes about directly from the full assembly of 32 pieces, the principle about economy of force in compositions doesn’t necessarily hold and the rule can even be turned on its head. In contrast to “massacre” proof games – a sub-type where the diagram positions are super-economical in terms of the number of pieces – proof game positions with most or all of the 32 units present may be viewed as more pristine or neat, exhibiting “economy of captures.” Totally capture-free play thus becomes a positive feature, or a challenging restriction, with which to accomplish a problem’s principal theme, whatever that might be.