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
This is a n-queen problem solver using local search algorithms.
The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.
Parallel Computing with Pthreads
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.
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.
N-Queens GUI solver using A* (A-Star) and Genetic Algorithm.
Solution for both N Queens Puzzle and Knight's Tour (with GUI)
N-Queens problem solvers and solution counters implemented using a constrained DFS algorithm
Full Genetic Algorithm para resolver o problema das N-rainhas
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
N-Queens Solution With Genetic Algorithms
Different puzzles to think and enjoy programming.
Southeast University Artificial Intelligence Coursework (with a Final Score: 96/100)
Project focuses on optimised implementation of Backtracking and Forward Checking algorithms in order to find all solutions of the N Queens problem
Add a description, image, and links to the n-queens topic page so that developers can more easily learn about it.
To associate your repository with the n-queens topic, visit your repo's landing page and select "manage topics."