Linear Programming, Kakuro Puzzles, Gurobi, Puzzle Game, Discrete Optimization.
x_2,2,k where k starts from 1 and goes to 9, must be exactly 1. Note that this doesn’t specify which k should be chosen, but rather each empty cell must have exactly one value. Results and Python Implementation With those 5 simple constraints, we have a BILP that can solve any valid Kakuro puzzle!