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

Algorithm 1

Cuckoo search.

Input: 𝑁𝑒𝑠𝑡_{𝑠𝑖𝑧𝑒},𝛼,𝜆

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

(1)  𝑁𝑒𝑠𝑡𝑠 ←  GenerateInitialPopulation(𝑁𝑒𝑠𝑡_size)

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

(3)   𝐸𝑔𝑔_𝑖 ←  GetCuckooByLevyFlight(𝑁𝑒𝑠𝑡𝑠,𝛼,𝜆)

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

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

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

(7)   End If

(8)   𝐸𝑔𝑔_best ←  FindCurrentBest(𝑁𝑒𝑠𝑡𝑠)

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

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

(11)  End While