Recursive Backtracking for Solving 9*9 Sudoku Puzzle | Zendy

Dhanya Job | Zendy; Varghese Paul | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Recursive Backtracking for Solving 9*9 Sudoku Puzzle

Author(s) -

Dhanya Job,

Varghese Paul

Publication year - 2016

Publication title -

bonfring international journal of data mining

Language(s) - English

Resource type - Journals

eISSN - 2277-5048

pISSN - 2250-107X

DOI - 10.9756/bijdm.8128

Subject(s) - backtracking , computer science , newspaper , theoretical computer science , mathematics , artificial intelligence , algorithm , advertising , business

Nowadays Sudoku is a very popular game throughout the world and it appears in different medias, including websites, newspapers and books. There are numerous methods or algorithms to find Sudoku solutions and Sudoku generating algorithms. This paper explains possible number of valid grids in a 9*9 sudoku and developed a programming approach for solving a 9*9 sudoku puzzle and the results have been analysed in accordance with various number of clues for 9*9 sudoku.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research