Sudoku is a pretty popular number game. The goal of this game is to fill a 9x9 matrix with unique numbers, and there should not be repeated numbers in each row, column, or block. This paper proposed a solution to solve Sudoku using the Backtracking Algorithm. This algorithm is quite efficient because it does not have to check all the possibilities that exist, but which leads to only the solution that will be processed, namely by pruning every element that does not lead to the solution. Thus the time required is quite efficient and suitable for use in reasonably complex numbers games like sudoku. By implementing the backtracking algorithm in the sudoku game, the complexity of the algorithm can be as large 𝜽 (n3).