Solving 8-Queens Problem by Using Genetic Algorithms, Simulated Annealing, and Randomization Method

摘要

This paper introduced two Metaheuristics algorithms for solving 8-queens problem in addition to randomized method for finding all the 92 possible solutions for 8*8 chess board. The Metaheuristics algorithms are Genetic Algorithm (GA) and Simulated Annealing (SA). The proposed randomization method depends mainly on randomization in both the initialization phase and moving phase that is used to find all the solutions. The obtained results were promising as the GA and SA algorithms were efficient in finding the solutions and both are better than the randomization method. Also it has been found that SA was better than the GA as it required less number of steps in finding the solutions.