Introductions and background for papers I have worked on
These posts introduce papers I have worked on. They give some context for the question behind each paper, explain the main idea through an example where useful, and collect links to the paper and supporting material.
Selecting well-spaced points looks simple, but the usual decomposition creates quadratically many auxiliary variables. This post compares direct Gecode propagators and shows how a matching bound can strengthen them.
The main result is a public collection of 434,201 generated Sudoku instances, ranging from 6×6 to 36×36. The paper's experiments provide a map of how their propagation-based hardness changes with size.
A real wedding seating plan led to a MiniZinc model that balances practical requests with the chance of finding something to talk about. The post shows the central constraints and the mixed-radix objective.
The Work Task Variation Problem, a paper by Mikael Z. Lagerkvist and Magnus Rattfeldt at CP 2025.
Half-checking propagators, a paper by Mikael Z. Lagerkvist and Magnus Rattfeldt at ModRef 2020
Half-checking propagators, a paper by Mikael Z. Lagerkvist and Magnus Rattfeldt
Nmbr9 as a Constraint Programming Challenge, a paper by Mikael Z. Lagerkvist
State Representation and Polyomino Placement for the Game Patchwork, a paper by Mikael Z. Lagerkvist
Monte Carlo Methods for the Game Kingdomino, a paper by Magnus Gedda, Mikael Z. Lagerkvist and Martin Butler
