Here are some published proof games that I composed with a computer. I like proof games because the desired aesthetics are easier to program than for a typical "mate in n" problem. I say "composed with a computer" because really the computer is the one finding the problem. Still, it takes a lot of skills from my part to imagine problems that aren't trivial for humans to compose, yet do not require the age of the universe to compute. The problems are not necessarily better than the human-created ones, but the style is different.
| month | magazine | problem # | intended theme |
|---|---|---|---|
| 2004-04 | Problemesis 38, retros | R142 | twin problem with vertical symmetry |
| " | " | R143 | record of the most depleted "at-home" position |
| " | " | R144 | fullest "at-home" position with no pawns |
| 2004-06 | Problemesis 39, retros | R152 | every move is a capture with nightriders (anticipated) |
| " | " | R153 | maximum length in one-sided chess with no pawn move |
| " | " | R154 | twin problem found in my set of 89 3-piece problems in 17.0 moves |
| 2004-08 | Problemesis 40, retros | R171 | maximum length with all 16 pawns present on their start squares |
| " | " | R172 | each side ends up with pieces of the same type through massacre and promotion |
| 2005-02 | Problemesis 43, retros | R187 | symmetric "at-home" position with asymmetric solution |
| 2005-04 | Problemesis 44, retros | R192 | maximum length with pawn moves only |
Problemesis is an online, bilingual French-English chess problem magazine.
back to Chess Problems by Computer