Research Article
A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles
Algorithm 2
Hybrid alldifferent-Tabu search.
Input: | Output: | (1) ← alldifferent() | (2) tabuList← | (3) While Stop Condition do | (4) CandidateList← | (5) While Len(CandidateList) ≤ do | (6) push(CandidateList, CandidateGenerator(, )) | (7) End While | (8) ← LocateBestCandidate(CandidateList) | (9) ← alldifferent() | (10) If cost() ≤ cost() | (11) ← FeatureDifferences() | (12) | (13) While do | (14) ExpireFeature() | (15) End While | (16) End If | (17) End While | (18) Return |
|