Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
horizontal run and ensuring that at most one k-value is used in the horizontal run. We use ≤ 1 because we are not guaranteed that every k-value is used. It is entirely possible that k will not be used in a given horizontal run. However, we know k cannot be used more than once for one clue!