Sudoku is a combinatorial number placement puzzle.

Higherrank sudokus usually have n^{2}×n^{2} board with n×n boxes (n>3).
(e.g. 16*16, 25*25, 100*100)

We have done research about this problem in depth. Researchers in other institutions have implemented Sudoku solvers with OpenMP even though we did not find their code online. The theoretical speedup of Sudoku solver with OpenMP is linear. We have seen some theoretical works on MPI implementation, but we did not use them for our Sudoku solver. 