Sudoku Solver

University of Colorado
Spring 2018

Optimization can be simply described as the minimization of a cost function based on a set of constraints. Optimization methods have endless applications. In general, convex optimization methods solve continuous number problems. Sudoku puzzles provide an interesting challenge as they require an integer solution. This is easy for humans to do, but is more of a challenge for a computer. By using a different method of number representation and manipulating the cost function, I was able solve the integer sudoku problem using continuous numbers. My solver was able to solve easy, medium, and hard sudoku problems.