Recursive Backtracking for Solving 9*9 Sudoku Puzzle

  • Job D
  • Paul V
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Job, D., & Paul, V. (2016). Recursive Backtracking for Solving 9*9 Sudoku Puzzle. Bonfring International Journal of Data Mining, 6(1), 07–09. https://doi.org/10.9756/bijdm.8128

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free