A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems

Algorithm 8

Prefiltered discrete cuckoo search.

Input: 𝑁𝑒𝑠𝑡_{𝑠𝑖𝑧𝑒},𝑋,𝐷,𝐶,𝑃_{𝑝𝑚𝑥-𝑚𝑢𝑙𝑡𝑖},𝑃_{𝑚𝑢𝑡𝑎𝑡𝑒}

Output: 𝐸𝑔𝑔_{𝑏𝑒𝑠𝑡}

(1)  𝐷← AC3(𝑋,𝐷,𝐶)

(2)  𝑁𝑒𝑠𝑡𝑠 ← GenerateInitialPopulation(𝑁𝑒𝑠𝑡_{𝑠𝑖𝑧𝑒},𝐷)

(3)  While  ¬  𝑆𝑡𝑜𝑝𝐶𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛 do

(4)   𝐸𝑔𝑔_𝑖 ← GetRandomlyFrom(𝑁𝑒𝑠𝑡𝑠)

(5)   𝐸𝑔𝑔_𝑖 ← GeometricOperators(𝑃_{𝑝𝑚𝑥-𝑚𝑢𝑙𝑡𝑖},𝑃_{𝑚𝑢𝑡𝑎𝑡𝑒})

(6)   𝐸𝑔𝑔_𝑗 ← ChooseRamdomlyFrom(𝑁𝑒𝑠𝑡𝑠)

(7)   If cost(𝐸𝑔𝑔_𝑖) ≤ cost(𝐸𝑔𝑔_𝑗)

(8)    𝐸𝑔𝑔_𝑗 ← 𝐸𝑔𝑔_𝑖

(9)   End If

(10)    𝐸𝑔𝑔_{𝑏𝑒𝑠𝑡} ← FindCurrentBest(𝑁𝑒𝑠𝑡𝑠)

(11)    𝑁𝑒𝑠𝑡𝑠 ← AbandonWorseNests(𝑝_𝑎,𝑁𝑒𝑠𝑡𝑠)

(12)    𝑁𝑒𝑠𝑡𝑠 ← BuildNewSolutions(𝐸𝑔𝑔_best,𝐷)

(13)  End While