Este proyecto está dedicado a visualizar cómo se busca una solución al problema de las N reinas
-
Updated
Jun 19, 2024 - JavaScript
Este proyecto está dedicado a visualizar cómo se busca una solución al problema de las N reinas
N-Queen Solver using Hill Climbing Algorithm
A solver for the n-queens problem.
Tasks for Evolutionary Computing Course at ITMO University.
Code made for Constraint Programming classes, similar with the 8 queens problem, analyzing solutions, pruning and use of an heuristic to optimize our code
Here you will find my version of the algorithm that solves the Queens Problem
Logic to calculate and visualize all the solutions of the N Queens Problems
This project is a study project, answering to a school assignment.
Eight queens puzzle in C++
CE2103 | Extra clase #4 | Implementación de la solución al algoritmo de las N Reinas, utilizando Backtracking y mostrándo el proceso mediante hardware.
Solution of the n-Queens-Problem
N Queens problem solved by Hill Climbing with Random Restart
Bu program, genetik algoritma kullanarak 8-vezir problemini çözer.
Solve n x n Queen's problem by backtracking (DFS)
Developing a solution to the 8 queens problem
In the game of chess, the queen can attack any piece that lies on the same row, on the same column, or along a diagonal. The eight-queens is a classic logic puzzle. The task is to place eight queens on a chessboard in such a fashion that no queen can attack any other queen.
This project was presented for the Artificial Intelligence course for the academic year 2022/2023. It explores various methods to solve the N-Queens problem, including Random Search, Backtracking, Hill-Climbing, Simulated Annealing, and Genetic Algorithms. Each method is evaluated for its efficiency and effectiveness in finding solutions.
Add a description, image, and links to the queens-problem topic page so that developers can more easily learn about it.
To associate your repository with the queens-problem topic, visit your repo's landing page and select "manage topics."