Research Article

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

Table 4

Iterations needed (minimum, average, maximum, and standard deviation) considering 30 runs.

Difficulty groupDifficulty subgroupIterations
alldiff-TS AC3-TS
Minimum Average Maximum Minimum Average Maximum

Easy 1 1 1 1 0 1 1 1 0
2 1 1 1 0 1 7.4 58 11.7
E 1 1 1 0 1 1 1 0
Easy 1 1 1 0 1 1 1 0

Medium 3 1 2.0 7 1.6 3 90.2 897 140.5
4 1 13.1 95 23.5 2 163.3 1,318 226.3
5 1 20 276 45.0 5 143.9 1,778 230.4
C 1 1 1 0 1 4.0 29 6.0
D 1 27.2 424 64.5 5 1,897.6 9,088 2,214.3
Medium 1 1 1 0 5 138.8 865 173.9

Difficult SD 3 51.5 298 68.8 10 5,005.6 29,329 7,358.1
Hard 1 195.0 1881 397.0 4 1,872.4 7,590 2,217.6

Most difficultAI Escargot52 1,248.3 6,328 1,378.6 57 2,566.7 7,224 2,076.6