Este proyecto está dedicado a visualizar cómo se busca una solución al problema de las N reinas
-
Updated
Apr 25, 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
Implementação de algoritmo de Backtracking com o problema das rainhas
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.
Here you will find my version of the algorithm that solves the Queens Problem
picocli example: solve queens puzzle with choco-solver
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
N Queens problem solved by Hill Climbing with Random Restart
A Delphi Pascal Windows Program that calculates and displays all possible solutions of the 8 Queens Problem
Bu program, genetik algoritma kullanarak 8-vezir problemini çözer.
Solve N-queens problems using Simulated annealing algorithm
Logic to calculate and visualize all the solutions of the N Queens Problems
Polyomino.jl - Polyomino generation and chess algorithms implemented in Julia
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."