Research Article
A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems
Table 2
Comparing the prefiltered discrete cuckoo search with the best-performing incomplete methods for Sudokus considering 100000 and unlimited iterations.
| | Problem | Prefiltered discrete CS | Hybrid TS | GA | | Unlimited iterations | 100000 iterations | Unlimited iterations | 100000 iterations | Unlimited iterations | 100000 iterations |
| | Easy a | 30 | 30 | 30 | 30 | 30 | 29 | | Easy b | 30 | 30 | 30 | 30 | 30 | 30 | | Easy c | 30 | 30 | 30 | 30 | 30 | 30 | | Medium a | 30 | 30 | 30 | 30 | 30 | 10 | | Medium b | 30 | 30 | 30 | 30 | — | — | | Medium c | 30 | 30 | 30 | 30 | — | — | | Hard a | 30 | 30 | 30 | 30 | 30 | 2 | | Hard b | 30 | 30 | 30 | 30 | — | — | | Hard c | 30 | 30 | 30 | 30 | — | — |
|
|
