paper-with-me

Papers

An Adaptive Genetic Algorithm for Solving N-Queens Problem

2017-11-01 · Uddalok Sarkar, Sayan Nag

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.

📄 PDF Abstract BibTeX arXiv:1802.02006

Code (1)

depanker/ml-problems

Similar Papers 제목 키워드 기반

Application of the Brain Drain Optimization Algorithm to the N-Queens Problem

2025-04-26 · Sahar Ramezani Jolfaei, Sepehr Khodadadi Hossein Abadi

This paper introduces the application of the Brain Drain Optimization algorithm -- a swarm-based metaheuristic inspired by the emigration of intellectual elites -- to the N-Queens problem. The N-Queens problem, a classic…

Combinatorial OptimizationDecision Making

Linear algorithm for solution n-Queens Completion problem

2019-12-05 · E. Grigoryan

A linear algorithm is described for solving the n-Queens Completion problem for an arbitrary composition of k queens, consistently distributed on a chessboard of size n x n. Two important rules are used in the algorithm:…

Temporal Heterogeneity Improves Speed and Convergence in Genetic Algorithms

2022-02-02 · Yoshio Martinez, Katya Rodriguez, Carlos Gershenson

Genetic algorithms have been used in recent decades to solve a broad variety of search problems. These algorithms simulate natural selection to explore a parameter space in search of solutions for a broad variety of prob…

Solving N-Queen Problem using Las Vegas Algorithm with State Pruning

2025-12-03 · Susmita Sharma, Aayush Shrestha, Sitasma Thapa, Prashant Timalsina 외 arxiv

The N-Queens problem, placing all N queens in a N x N chessboard where none attack the other, is a classic problem for constraint satisfaction algorithms. While complete methods like backtracking guarantee a solution, th…

From Frustration to Fun: An Adaptive Problem-Solving Puzzle Game Powered by Genetic Algorithm

2025-09-28 · Matthew McConnell, Richard Zhao arxiv

This paper explores adaptive problem solving with a game designed to support the development of problem-solving skills. Using an adaptive, AI-powered puzzle game, our adaptive problem-solving system dynamically generates…