Analysis of Sudoku Solving Algorithms
暂无分享,去创建一个
The idea of this paper is to analyse the performance of various Sudoku solving algorithms. A well laid out groundwork has been done to find out the efficient and fast approach to making the computer solve a Sudoku. After considering multiple options like Backtracking and Brute Force Algorithm, the research ended up with DANCING LINKS algorithm that was proposed to the world by DONALD KNUTH, which he claimed was the best approach to solving a Sudoku from a computational perspective. Also, a comparative analysis of the chosen algorithm with the more traditional approaches was performed to know the competence of our algorithm. Keyword Dancing Links, Sudoku solver, Backtracking, Brute Force, Donald Knuth.
[1] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[2] Padma Bonde,et al. Study on the Performance Characteristics of Sudoku Solving Algorithms , 2015 .
[3] Donald E. Knuth,et al. Dancing links , 2000, cs/0011047.
[4] H. Simonis,et al. Sudoku as a Constraint Problem , 2005 .