Visualization of some standard problems solved by Backtracking
-
Updated
May 30, 2024 - JavaScript
Visualization of some standard problems solved by Backtracking
AI mini projects
Solving the N-Queens problem using Local Beam and BFS
GPU-accelerated tree-search in Chapel
In this repository, you'll find Prolog code covering a range of questions, all designed to aid your learning journey.
An N-Queens solver implemented using a genetic algorithm, providing efficient heuristic solution.
This Python code solves the N-Queens problem using a genetic algorithm. The goal is to place N chess queens on an N×N chessboard so that no two queens can attack each other. The algorithm trying different queen arrangements over many generations, selecting the best ones, mixing them up, and occasionally making small changes (mutations).
Some of my Algorithms Design projects
problema n-rainhas usando técnicas de satisfação de restrições
N-Queens solver in Common Lisp
Emulator of the N-Queens problem
A java program that solves the n-queens puzzle using Hill Climbing and Random Restart algorithm in Artificial Intelligence.
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
Solving the N-queens problem via the Metropolis algorithm
Visualize the famous N-Queens problem 👑
Practicals from sem 5 of bsc IT,Third year
N-Queens GUI solver using A* (A-Star) and Genetic Algorithm.
An implementation of genetic algorithm to solve the n-queens problem
A machine learning library for kotlin JVM.
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."