Repository navigation

#

nqueens-problem

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

Python
15
2 年前

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

Python
14
2 个月前

Solving the nqueens problem using genetic algorithm

Python
10
7 年前

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

Python
9
5 年前

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.

Python
5
4 年前

An Online n queens board

JavaScript
4
2 年前

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

Java
4
6 年前

Solving N-queens problem with Genetic Algorithm - Artificial Intelligence

C
4
4 年前

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.

Jupyter Notebook
3
2 年前

An interactive visualizer for N-Queen problem using backtracking.

JavaScript
3
4 年前

Genetic Algorithm for Solving NQueens Problem

Python
3
2 年前

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.

C
3
3 年前

Solving N-Queen problem using Genetic Algorithm.

C++
3
5 年前

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

Python
3
7 年前

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.

Python
2
6 年前

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

Go
2
7 年前

Basically it is a solution for "N-Queen" Problem. I added mix of humor to the code. Sounds like "The King" wanted date all "The Queen" :)

Go
2
7 年前

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.

C
2
2 年前