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

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

Solving the nqueens problem using genetic algorithm

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.

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

Design and Analysis of Algorithms

Solving N-Queen problem using Genetic Algorithm.

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.

An Online n queens board

An interactive visualizer for N-Queen problem using backtracking.

Genetic Algorithm for Solving NQueens Problem

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.

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

Solving N-queens problem with Genetic Algorithm - Artificial Intelligence

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.

N Queens Problem - Explanation & Implementation

N-Queens problem solution using Hill-Climbing algorithm rewritten from Common Lisp to Go (https://github.com/joaobap/clisp-hill-climbing)

This repository contains a parallel computing solution for the n-queens problem using brute force and OpenMPI, implemented as part of the final assignment for my university course in Parallel Computing.

Solve N queens problem with an algorithm written in JavaScript. Solutions are displayed in a chess board drawn by D3js. You can choose the n size between 4 and 10.