The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.

find arrangement for n Queens in n*n board of chees using Genetic algorithms

Solving the nqueens problem using genetic algorithm

Python Implementation for N-Queen problem using Hill Climbing, Genetic Algorithm, K-Beam Local search and CSP

The 8-queens problems asks us to place 8 queens on a chessboard so that no two can capture one another; that is, no two are on the same row, column, or diagonal.

Design and Analysis of Algorithms

Solving N-queens problem with Genetic Algorithm - Artificial Intelligence

Hill Climbing and Hill Climbing With Random Restart implemented in Java.

An Online n queens board

This repository lists 4 problems solved using C. Each problem has its own serial and parallel implementations. For the latter, the OpenMP API was utilized.

Optimizing the NQueen Puzzle using different optimization techniques including backtracking, local search, and genetic algorithm (GA) for evolving towards a state where no two queens are attacking each other.

A simple python(also cython) script to solve and visualize N-Queens problem

An interactive visualizer for N-Queen problem using backtracking.

AI Assignments - FAST NUCES (Karachi) - CS401 - Spring 2020

Genetic Algorithm for Solving NQueens Problem

Solving N-Queen problem using Genetic Algorithm.

//contains recursion programs for practice and learning

Implementation of the N-Queens problem by using Simulated Annealing as a local search algorithm and Min Conflicts as the CSP (Constraint Satisfaction Problem) algorithm.

Advanced Algorithms Problems | Engineering

Implementation of search algorithms, BFS (Breadth First Search) and DFS (Depth First Search), to solve the NQueens problem.