Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
values of k, we can have at most one of each integer 1–9 appear in the horizontal clue. The term in the summation, is simply the binary variable x_{i,j,k}. The binary variable will only be 1 if we decide to place k in the coordinate (i,j). For every k-value, the summation is moving across the