Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
(2,3), (3,2), and (3,3) . Each of these cells can take any integer value, k, where 1 ≤ k ≤ 9. This means that we will have 2 · 2 · 9 = 36 binary variables. Because we have 4 cells to fill, all but 4 of these binary variables have the value 0. The four binary variables equal to one for our solution