Efficient Data Structures for Solving Sudoku Puzzles

Proceedings of The World Conference on Innovation in Technology and Engineering Sciences

Year: 2021


[Fulltext PDF]

Efficient Data Structures for Solving Sudoku Puzzles

Adiba Afif Suha Binta Wadud and M. Abdullah-Al-Wadud



A Sudoku puzzle requires filling in the empty cells ensuring that no number is repeated within the same row, column or sub-grid. To find the appropriate numbers, Sudoku-solving algorithms usually have to try and validate different options that include a great deal of repetitive and redundant tasks. In this paper, we propose some data structures and related algorithms to minimize such tasks and thereby improve the efficiency. Experimental evaluations on different Sudoku puzzles shows that the proposal improves the performance significantly.

keywords: Algorithms, backtracking, hybrid, pencil and paper, puzzles.