Research Article
A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems
Table 1
Solving Sudokus with the prefiltered discrete cuckoo search considering 10000 iterations.
| ā | Tries | Solved | Min. solving time (sec) | solving time (sec) | Max. solving time (sec) | SD time (sec) |
| Easy a | 50 | 50 | 1.302 | 1.310 | 1.329 | 0.004 | Easy b | 50 | 50 | 1.005 | 1.007 | 1.029 | 0.003 | Easy c | 50 | 50 | 1.019 | 1.021 | 1.036 | 0.003 | Medium a | 50 | 50 | 2.501 | 384.341 | 1171.312 | 291.336 | Medium b | 84 | 50 | 38.32 | 729.673 | 1932.691 | 516.867 | Medium c | 67 | 50 | 26.807 | 800.471 | 1923.442 | 561.877 | Hard a | 97 | 50 | 385.652 | 2059.690 | 3777.340 | 984.921 | Hard b | 62 | 50 | 49.608 | 1484.692 | 6810.882 | 1473.731 | Hard c | 71 | 50 | 9.497 | 771.211 | 3561.042 | 825.516 |
|
|