My thesis is about finding an automated solution for Sudoku puzzles (2x2, 2x3, 3x3, and X-Sudoku). Sudoku is a puzzle where in you have to fill a 9x9 grid with numbers from 1 to 9 in such a way so each box, row and column only contains one occurrence of those nine numbers. I will be using the backtracking algorithm and regarding the problem as a Constraint Satisfaction Problem. I will mainly use Java and JavaFX to accomplish this goal.