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.

Voilà une liste d'algorithmes courants, implémentés en Rust. Peut éventuellement servir pour préparer des cours sur ce langage.

Tasks for Evolutionary Computing Course @ ITMO University.

Donald Knuth's Algorithm 7.2.2.1M for covering with multiplicities and colors via dancing links

The task is to arrange 10 queens on a 10x10 chessboard in such a way that none of them can attack the others

♟️ A program that displays all possible locations of ten queens on a chessboard

The solution is [3,1,2,4]. The first queen should be placed in the 1st row 3rd column, the second queen should be placed in 2nd row 1st column, the third queen should be placed in 3rd row 2nd column and finally, the 4rth queen should be placed in 4rth row 4rth column.

picocli example: solve queens puzzle with choco-solver

NQueens puzzle implemented with OpenMP and OpenMPI

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 eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal.

This is a promising implementation of the n-Queens problem in C. It uses a recursive backtracking algorithm to find all solutions to the n-Queens problem. It is a promising implementation because it uses a heuristic to prune the search tree. The heuristic is to only place a queen in a column if it is not in check with any other queens.

Tasks for Evolutionary Computing Course at ITMO University.

A Python project for solving 8 queens problem and visualizing it using OpenCV library.

Queens puzzle JavaScript solver

Different puzzles to think and enjoy programming.

Logic to calculate and visualize all the solutions of the N Queens Problems

♟ Eight queens game online app with backtracking algorithm to solve it. Chess board on which eight queens must be placed so that they cannot attack each other.

Implementação de algoritmo de Backtracking com o problema das rainhas

An Nqueen algorithm for humans 👸