8 queens problem using ga

The document discusses solving the eight queens problem using a genetic algorithm (GA). It describes representing the chessboard configuration as a string of numbers indicating each queen's position. A fitness function counts non-attacking queen pairs. The GA then performs selection, crossover and mutation on the population to evolve solutions, iteratively improving the average fitness until finding an arrangement with no attacking queens.