An Adaptive Genetic Algorithm for Solving N-Queens Problem

TL;DR

This paper introduces an adaptive genetic algorithm with a novel fitness function to efficiently solve the N-Queens problem, demonstrating improved performance over previous methods for large N values.

Contribution

The paper presents a new genetic algorithm approach with a unique fitness function tailored for the N-Queens problem, enhancing solution speed and quality.

Findings

Achieves solutions faster than previous methods for large N

Yields high-quality solutions with fewer generations

Demonstrates scalability for large N values

Abstract

In this paper a Metaheuristic approach for solving the N-Queens Problem is introduced to find the best possible solution in a reasonable amount of time. Genetic Algorithm is used with a novel fitness function as the Metaheuristic. The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others. Chromosome representation and genetic operations like Mutation and Crossover are described in detail. Results show that this approach yields promising and satisfactory results in less time compared to that obtained from the previous approaches for several large values of N.