Here are some published chess problems that I composed with a computer. Most of them are proof games. 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 # | Stipulation | Intended theme |
---|---|---|---|---|

2004-04 | Problemesis 38, retros | R142 | proof game | twin problem with vertical symmetry |

R143 | proof game | record of the most depleted "at-home" position | ||

R144 | proof game | fullest "at-home" position with no pawns | ||

2004-06 | Problemesis 39, retros | R152 | proof game | every move is a capture with nightriders (anticipated) |

R153 | proof game | maximum length in one-sided chess with no pawn move | ||

R154 | proof game | twin problem found in my set of 89 3-piece problems in 17.0 moves | ||

2004-08 | Problemesis 40, retros | R171 | proof game | maximum length with all 16 pawns present on their start squares |

R172 | proof game | each side ends up with pieces of the same type through massacre and promotion | ||

2005-02 | Problemesis 43, retros | R187 | proof game | symmetric "at-home" position with asymmetric solution |

2005-03 | Probleemblad Mar-Apr 2005, retros | R274 | proof game | symmetric, at-home, 2 solutions (with Joost de Heer) |

2005-04 | Problemesis 44, retros | R192 | proof game | maximum length with pawn moves only |

2010-04 | ChessProblems.ca T1-10 | T6 | series A=>B proof game, Platzwechsel Circe | twin problem, no solution in n+1 moves (with Alexandre Leroux) |

Problemesis was an online, bilingual French-English chess problem magazine.

Month | Competition | Stipulation | Theme |
---|---|---|---|

2005-02 | Problem Online, proof game task tournament 1 (with Alexandre Leroux) | proof game | knight polygon of maximum area |

2005-05 | Messigny 2005, proof game composition tournament | proof game | a piece A intercepts a piece B on 2 different lines |

2006-11 | Diagrammes, thematic tourney (in French) | series A=>B proof game | most moves, only two kings remaining |

2006-12 | French ISC 2007, Christmas composing tourney [proof game awards] | Multicaptures chess | (free) |

2008-07 | Itamar Faybish, tournament 3 (see the "Addendum" on the Results page) | series help-stalemate, Lortap chess | most moves |

2008-12 | French ISC 2009, Christmas composing tourney [retro awards] [all awards (in French)] | Provocateurs chess | (free) |

2010-02 | ChessProblems.ca, thematic tournament 2 (with Alexandre Leroux) | any series stipulation, fairy allowed | most moves, no solution in n+1 moves |

page last updated: January 19, 2012

back to Chess Problems by Computer