A Comparative Study On The Performance CharacteristicsOf Sudoku Solving Algorithms

Solving Sudoku, a NP-Complete combinatorial optimization problem has been carried out using the optimized Graph Referencing Algorithm (GRA),Genetic Algorithm (GA), Simulated Annealing (SA), Harmony Search (HS) and Brute Force algorithm. The present study is primarily aimed at finding out the fastest algorithm in terms of least time consumption in solving Sudoku. The performance characteristics of algorithms of interest are studied by deploying randomly selected puzzles with different difficulty levels. The comparative performance characteristics study reveals the superiority of the Graph Referencing algorithm over the other algorithms in taking least possible time to solve Sudoku.

[1]  Conor Ryan,et al.  Solving Sudoku with the GAuGE System , 2006, EuroGP.

[2]  Timo Mantere,et al.  Solving, rating and generating Sudoku puzzles with GA , 2007, 2007 IEEE Congress on Evolutionary Computation.

[3]  Liu San-yang Algorithm Based on Genetic Algorithm for Sudoku Puzzles , 2010 .

[4]  David Eppstein Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku , 2005, ArXiv.

[5]  Satyendra Nath Mandal,et al.  An Efficient Approach to Solve Sudoku Problem by Harmony Search Algorithm , 2011 .

[6]  Henrik Vikstén,et al.  Performance and Scalability of Sudoku Solvers , 2013 .

[7]  Maria Clicia Stelling de Castro,et al.  Applying scheduling by edge reversal to constraint partitioning , 2003, Proceedings. 15th Symposium on Computer Architecture and High Performance Computing.

[8]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[9]  Zong Woo Geem,et al.  Harmony Search Algorithm for Solving Sudoku , 2007, KES.

[10]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[11]  T. Yato,et al.  Complexity and Completeness of Finding Another Solution and Its Application to Puzzles , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[12]  Timo Mantere,et al.  Solving and analyzing Sudokus with cultural algorithms , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[13]  Saubhik Paladhi,et al.  An Optimized Algorithm for Solving Combinatorial Problems using Reference Graph , 2014 .

[14]  Kamran Zamanifar,et al.  Sudoku Using Parallel Simulated Annealing , 2010, ICSI.

[15]  Rhyd Lewis,et al.  Metaheuristics can solve sudoku puzzles , 2007, J. Heuristics.

[16]  C. Darwin On the Origin of Species by Means of Natural Selection: Or, The Preservation of Favoured Races in the Struggle for Life , 2019 .

[17]  Zhang Zong-ke Solve & Generate Sudoku Puzzle by Programming in AutoCAD , 2008 .

[18]  Xiu Qin Deng,et al.  A novel hybrid genetic algorithm for solving Sudoku puzzles , 2013, Optim. Lett..