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

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.

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

Problems solved using Genetic Algorithms.

Different algorithms of AI implemented in Python.

An interactive visualizer for N-Queen problem using backtracking.

This code was submitted as programming project two for ITCS 6150 Intelligent Systems under Dr. Dewan Ahmad at the University of North Carolina at Charlotte for the fall 2021 semester. The aim is to solve N-Queens problem using hill climbing algorithm and its variants.

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

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

Solving the nqueens problem using genetic algorithm

Evolutionary solution to the N-Queens problem.

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

An Nqueen algorithm for humans 👸

Solving 8-Queens problem using GA & BT on Android.

Design and Analysis of Algorithms

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.

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.

Hey there!! I made a small code for N queens using simple Hill climbing.

Parallel program for solving the nQueens chess problem

nQueen problem solver.