Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
-
Updated
Jul 4, 2017 - Java
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.
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.
Parallel Computing with Pthreads
Solution for both N Queens Puzzle and Knight's Tour (with GUI)
Full Genetic Algorithm para resolver o problema das N-rainhas
N-Queens problem solvers and solution counters implemented using a constrained DFS algorithm
N-Queens Solution With Genetic Algorithms
Solving n-queen problem by Biogeography-Based Optimization (BBO) algorithm
University project solving n-queen problem using CSP approach
Different puzzles to think and enjoy programming.
Southeast University Artificial Intelligence Coursework (with a Final Score: 96/100)
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."