There are 1 repository under n-queens topic.
Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
Visualization of some standard problems solved by Backtracking
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 is a n-queen problem solver using local search algorithms.
Introductory C ++ language exercises at the university in the basics of computer and advanced programming and discrete mathematics
My projects/labs for Udacity Artificial Intelligence Nanodegree (April 2017 - present).
Placing N chess queens on an NxN chessboard so that no two queens threaten each other.
N-Queens GUI solver using A* (A-Star) and Genetic Algorithm.
Modelling n-queens problem as conjunctive normal form and solving it with DPLL algorithm. This project should made me familiar with Rust and the test driven approach.
Solution for both N Queens Puzzle and Knight's Tour (with GUI)
Parallel Computing with Pthreads
N-Queens problem solvers and solution counters implemented using a constrained DFS algorithm
Full Genetic Algorithm para resolver o problema das N-rainhas
Solving N-Queen problem using Genetic Algorithm.
University project solving n-queen problem using CSP approach
Project focuses on optimised implementation of Backtracking and Forward Checking algorithms in order to find all solutions of the N Queens problem
Southeast University Artificial Intelligence Coursework (with a Final Score: 96/100)
Solving n-queen problem by Biogeography-Based Optimization (BBO) algorithm
A java solution to the Eight Queen(N Queen) problem
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. Simulated annealing is a probabilistic technique for approximating the global optimum of a given function.
Short 8 queens problem solution. Python
React app that solves the N-Queen puzzle in your browser using the minimum conflicts algorithm.
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.
Place N queens on said N×N chessboard so that no two queens threaten each other.
Solving N-Queens problem by implementing Memetic Algorithm.
N-Queens puzzle player. This tool will generate randomly or randomly locked puzzle, you may use this as "a boxing bag" to practice problem solving algorithm.
Resolving N queens problem with Backtracking Algorithm
optimization and palatalization of N queens problem using openmp
GPU-accelerated tree-search in Chapel