An easy implementation of the Genetic Algorithm for the Eight Queens Problem and some improvements to the basic design for faster convergence to a possible solution. The project also offers a short comparative study on the performance of the two versions of algorithms and possible reasons for the same.

The eight queens problem statement dictates placement of eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. This code is using Python to resolve the problem.

Solver for the N-Queens problem