 It is also possible to express a Sudoku as an integer linear programming problem.Such approaches get close to a solution quickly, and can then use branching towards the end.The simplex algorithm is able to solve non-proper Sudokus, indicating if the Sudoku is not valid (no solution), or providing the set of answers when there is more than one solution.