Sudoku game solving approach through parallel processing

Abstract

Sudoku is one of the most popular puzzle games of all time. Today, Sudoku is based on simple rules of placing the numbers from 1 to 9 in the empty cells of the Sudoku board. After solving the Sudoku, each row, column, and mini grid should have only one occurrence of each digit between 1 and 9. There are various approaches introduced to solve the Sudoku game till now. The solutions in the state of art are computationally complex as the algorithmic complexity for the solution falls under the class of NP-complete. The paper discusses various solutions for the problem along with their pros and cons. The paper also discusses the performance of a serial version solution with respect to execution time taken to solve Sudoku. With certain modifications and assumptions to the serial version code, we have evaluated the possible solution and bottleneck in the parallel approach. The results have been evaluated for the parallelized algorithm on a normal user machine first, and then on a supercomputing solution box PARAMSHAVAK. Finally, the paper is concluded with the analysis of all the three solution aspects proposed.