Year: 2018
Type: article
Abstract: N-queen problem represents a class of constraint problems. It belongs to set of NP-Hard problems. It is applicable in many areas of science and engineering. In this paper N-queen problem is solved using genetic algorithm. A new genetic algoerithm is proposed which uses greedy mutation operator. This new mutation operator solves the N-queen problem very quickly. The proposed algorithm is applied on some instances of N-queen problem and results outperforms the previous findings.
Authors: Vinod Jain, Jay Shankar Prasad
Institution: MVN University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2883600947
