A discrete version of the Giza PyramidsConstruction algorithm for solving n-queenproblem

The n-queen problem is a classic artificial intelligence problem. The main goal of this problem is to place the queens on thechess board in such a way that none of them can threaten from each other. This problem is a permutation problem and belongsto the category of NP-Hard problems. Metaheuristic methods can be used to solve these types of problems. In this paper, adiscrete version of the Giza Pyramids Construction (GPC) algorithm is presented to solve the n-queen problem. To conductthe experiments in this paper, seven problems are considered. Also, for comparison, Genetic Algorithm (GA) and SimulatedAnnealing (SA) algorithm were selected as two popular and developed algorithms. To compare the performance of thealgorithms, the number of function evaluations is considered as an evaluation criterion. The results of the experiments showthat the proposed algorithm has performed better than other competing algorithms in four out of seven problems. Thisalgorithm has also recorded a better run time than other algorithms. According to the results of the experiments, as the problembecomes more complicated, the proposed algorithm has a better performance than other competing algorithms

کلیدواژه ها:

n-queen problem ، Metaheuristics ، Giza Pyramids Construction (GPC) algorithm ، genetic algorithm ، simulatedannealing algorithm