A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

Algorithm 1

Tabu Search.

Input:

Output:

(1)   

(2)   

(3)   While    Stop  Condition  do

(4)   

(5)   For () do

(6)    If    ContainsAnyFeatures(, )

(7)     push(, )

(8)    End If

(9)   End For

(10) ← LocateBestCandidate()

(11)  If  cost() ≤ cost()

(12)  ← FeatureDifferences(, )

(13)  

(14)  While   > do

(15)   ExpireFeature()

(16)  End While

(17) End If

(18) End While

(19) Return