Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
row using i = i_{hc}, because we are working horizontally. Looking at the summation, we are moving from the lower bound column (j-value) to the upper bound column with a fixed i. This is essentially how we access the empty cells corresponding to the current horizontal clue. Constraint (1) For all