Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
coordinates that are initially empty. What is going on in this constraint? Let us fix an empty coordinate (i,j) as (2,2) for example. For a valid solution, we know that the initially empty coordinate (2,2) must have exactly one integer k placed into it. Therefore, the sum of the binary variables