Solving N-Queen pr
Solving N-Queen problem using Gravitational Search Algorithm
1Homayun Motameni, 2Seyyed Hossein bozorgi, 2mohammad ali shaban nezhad, 3Golnaz Berenjian, 4Behnam Barzegar*
1Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
2Young Researchers Club, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran
3Department of Computer Engineering, Tabari Institute of Higher Education, Babol, Iran
4Department of Computer Engineering, Nowshahr Branch, Islamic Azad University, Nowshahr, Iran
*Corresponding author: Behnam Barzegar
[email protected] or [email protected]
Abstract : The N-queens problem aims at placing N queens on an NxN chessboard, in such a way that no queen could capture any of the others. This problem is considered as one of the hard problem to be solved. Many researches have been interested to solve it with different Heuristic methods. In this paper, a new heuristic method, called the Gravitational Search algorithm or GSA will be shown in solving of the N-queens problem. The offered algorithm is named Gravitational Search algorithm N-queens or GSA-NQ and so as to confirm it, the algorithm should be implemented and compared with GA. The experimental results with proposed method gives the best results compare genetics algorithm.
[Homayun Motameni, Seyyed Hossein bozorgi, mohammad ali shaban nezhad, Golnaz Berenjian, Behnam Barzegar. Solving N-Queen problem using Gravitational Search Algorithm. Life Sci J 2013;10(1):37-44](ISSN:1097-8135). http://www.lifesciencesite.com. 6
Key words: N-queen problem, Gravitational search algorithm, combinatorial optimization.
