Tag
A researcher's blog post describes turning constraint models into playable puzzle games, based on his paper on scaling Sudoku as a constraint problem. It shares MiniZinc models, a repository of 434,201 Sudoku instances, and playable versions of nine puzzle games.
This paper investigates fine-tuning small language models (0.6B-20B parameters) to generate syntactically correct MiniZinc models from natural language descriptions, proposing a cross-model error bootstrapping method that achieves up to 98% execution accuracy, though solution accuracy remains limited.
Gecode 6.3.0 and 6.4.0 are released after a long pause, bringing a modernized build system (CMake) and updated MiniZinc integration.
The article argues that current benchmarks for Constraint Acquisition are inadequate and introduces MPMMine, a benchmark suite designed to assess algorithms that discover, validate, and enhance mathematical programming models using diverse domain knowledge artifacts.
The author describes using the MiniZinc constraint solver to solve The New York Times Pips puzzle, demonstrating how to express constraints and find solutions efficiently.