Solving N-Queen Problem Using Genetic Algorithm Using Advanced Mutation Operator

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.