a logic-based, combinatorial number-placement puzzle.
Fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 subgrids that compose the grid contain all of the digits from 1 to 9.
The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution.
Challenges
- Understand the problem (easy)
- Design the index sets (medium)
- Translate the model into Pyomo (easy)
Tooling
Model
Indexing Schema
Variables
$$ y^m_{i,j;k} = \begin{cases} 1, \ \text{ when cell \((i,j;k)\) contains number \(m\) }\\ 0, \ \text{ else }\\ \end{cases} $$

Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.