A better visualization of different algorithms made with React
This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies
Solving N-Queen problem using Genetic Algorithm.
N-Queen(s) Problem implemented using Simulated Annealing Algorithm in Python Language
Terminal implementation of the queen problem (place 8 chess queens on a 8x8 chessboard, none of them must see another one)
N-Queen(s) Problem implemented using Hill Climbing Algorithm in Python Language
An N-Queen Problem solver.
Emulator of the N-Queens problem
Solution to the N-Queen problem, using a Hill Climbing approach
problema n-rainhas usando técnicas de satisfação de restrições
The N Queens problem is a classic computer science problem that asks how to place N chess queens on an NxN chessboard such that no two queens threaten each other. It's used to study algorithms and artificial intelligence as it requires finding a solution that satisfies multiple constraints and making choices based on previous decisions.
The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.
It's the repository for a python package named nqviz, a visualization tool for the n-queen problem.
Add a description, image, and links to the n-queen topic page so that developers can more easily learn about it.
To associate your repository with the n-queen topic, visit your repo's landing page and select "manage topics."