Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
iterating over i values starting at the lower bound row, v_{lb}, to the upper bound row, v_{ub}. All Empty Cells Must Be Filled — Constraint 5 The vertical and horizontal constraints will guarantee that we don’t use more than one k-value for any given clue and that the values we place in any given