Solving N-Queen Problem by Genetic Algorithm using Novel Mutation Operator

N-Queen is a well-known NP-Hard problem. In N-Queen problem, the challenge is to place n queens on n*n chess board such that no two queens can attack each other. The problem can-not be solved using traditional algorithms. Genetic algorithm is a well-known optimization technique. The problem has to be represented in genetic form to solve it using genetic algorithm. In this paper a new mutation operator is proposed to solve N-Queen problem. The proposed algorithm is applied on some instances of N-Queen problem and it is observed that the proposed performs better as compared to other existing algorithms.