March 2018
·
2,477 Reads
·
5 Citations
International Journal of Computer Sciences and Engineering
The combinatorial optimization problem is a collection of problems which need a sample amount of time and effort to be solved. Vast difficulties have been occurring to solving these types of problem that there is no exact formula to solve the problem. Each feasible solution works on some order and the size of the probability increases algorithmically as the number of the problem also increases dynamically. This paper discusses about N-Queen problem, it is also a type of NP-hard problem. Many researchers have proposed various methods and algorithms for this problem. Henceforth, Genetic Algorithm is one kind of famous algorithm for solving NP hard problems. This paper mainly focuses on the review work of genetic algorithm to solve the N-Queen Problems (NPQ).