a discrete version of the giza pyramids construction algorithm for solving n-queen problem

The n-queen problem is a classic artificial intelligence problem. the main goal of this problem is to place the queens on the chess board in such a way that none of them can threaten from each other. this problem is a permutation problem and belongs to the category of np-hard problems. metaheuristic methods can be used to solve these types of problems. in this paper, a discrete version of the giza pyramids construction (gpc) algorithm is presented to solve the n-queen problem. to conduct the experiments in this paper, seven problems are considered. also, for comparison, genetic algorithm (ga) and simulated annealing (sa) algorithm were selected as two popular and developed algorithms. to compare the performance of the algorithms, the number of function evaluations is considered as an evaluation criterion. the results of the experiments show that the proposed algorithm has performed better than other competing algorithms in four out of seven problems. this algorithm has also recorded a better run time than other algorithms. according to the results of the experiments, as the problem becomes more complicated, the proposed algorithm has a better performance than other competing algorithms.