Particle Swarm Optimization For N-Queens Problem
The N-Queen is one of the prominent toy problems for performance assessment in the domain of Computational Intelligence. The problem can examine the diverse aspects of solving techniques, counting the potential of obtaining feasible solution and time & space complexity. The well-defined set of constraint sketches out the overall problem. The Queen has various attacking options over the chessboard. In point of fact, it can walk off across the column, row and two diagonal. The feasible solution of N-Queens demands the non-attacking placements over the chessboard. This research inspects the effectiveness of Particle Swarm Optimization in order to solve the problem. In PSO, the particle contains a structured set of Queen Placements. Current position of particle is well directed by the pbest and gbest parameters, each new generation obtains more converged set of particles. The partial but improved outcome promotes and furnishes to succeeding generation while the substandard may be discarded. The investigational results make known the dynamic features of PSO and eventually validate the effectiveness of research direction.
Keywords: N-Queens problem, PSO, Constraints.