Comparative analysis of algorithms for solving Sudoku

Emil Wnuk

emil.wnuk@gmail.com
Lublin University of Technology (Poland)

Edyta Łukasik


Lublin University of Technology (Poland)

Abstract

The article presents a comparative analysis of selected algorithms for solving Sudoku. Puzzles of different sizes and having different levels of difficulty are compared. The impact of these factors on the duration of the algorithms is examined. For the study, a special application that contains all the necessary algorithms has been created.


Keywords:

Sudoku; algorithms; solving time

[1] Wilson R.J., Jak rozwiązywać sudoku, Dom Wydawniczy Rebis, Poznań 2005
[2] H. Intelm, How to Solve Every Sudoku Puzzle, Vol.2, Geostar Publishing LLC. 2005.
[3] N. Jussien, A-Z of Sudoku, ISTE Ltd., USA, 2007.
[4] W.-M. Lee, Programming Sudoku, Apress, USA, 2006.
[5] Arnoldy, Ben. "Sudoku Strategies". The Home Forum. The Christian Science Monitor.
[6] Gordon Royle, The University of Western Australia. Minimum Sudoku.
[7] M.H.Alsuwaiyel, Algorithms Design Techniques and Analysis. London: World Scientific Publishing Company. 2008.
[8] Daniel J. Bernstein, Understanding brute force. 2007.
[9] Peter van Beek, Backtracking Search Algorithms, 2006 Elsevier
[10] George T. Heineman, Algorithms in a nutshell, Apress, 2008
[11] H. Intelm, How to Solve Every Sudoku Puzzle, Vol.4, Geostar Publishing LLC. 2007.

Published
2016-12-30

Cited by

Wnuk, E., & Łukasik, E. (2016). Comparative analysis of algorithms for solving Sudoku. Journal of Computer Sciences Institute, 2, 140–143. https://doi.org/10.35784/jcsi.130

Authors

Emil Wnuk 
emil.wnuk@gmail.com
Lublin University of Technology Poland

Authors

Edyta Łukasik 

Lublin University of Technology Poland

Statistics

Abstract views: 261
PDF downloads: 162