Trends in Computational Intelligence, Security and Internet of Things: Third International Conference, ICCISIoT 2020, Tripura, India, December 29-30, 2020, Proceedings

Sudoku is a Japanese logical puzzle solved using brain power. In this puzzle, the player places a digit among 1 to n in such a way that no cell in the same row, grid and column have the same value. In an n × n grid, there exists n possibilities of placing a value in a cell. This puzzle is available at different difficulty level. Generating a Sudoku puzzle with a specific difficulty level is a challenging task. Though there are various algorithms exist in the literature for generating the brainteaser, all of them either uses Backtracking technique or patterns for problem generation. This leads to exponential time complexity. Hence, there is a need for a polynomial-time solution that takes care of all possible cases. In this paper, we propose a polynomial time algorithm for generating the Sudoku puzzle in DNA computing using the Adleman-Lipton model. The puzzle is initially represented as a graph, later graph colouring algorithm is applied to it. From the obtained solution, randomly few cells are removed to obtain the puzzle with required difficulty level.