Solving N-Queens problem using Genetic Algorithms

1 Introduction The N-Queens problem is a classical AI problem. Its name is derived from the allowed moves for the queen piece in chess. Queens are allowed to move horizontally, vertically, or diagonally, backward and forward, with the only restriction being that they can move in only one direction at a time. A queen that can reach another piece in one move captures it. The N-Queens problem is based on the notion of trying to place …

…want to set N to higher values. He/she should first increase the number of generations because high population sizes don't have much effect for the improving. If this doesn't work, then only he/she should increase the population sizes. In the future, I would also like to change the genetic algorithm's scaling, selection, crossover and mutation methods. Experiments should be done to find out which combination will give us the best effective run conditions.