A N Queens solver using Las Vegas algorithm.
-
Updated
Oct 28, 2016 - C++
A N Queens solver using Las Vegas algorithm.
Implementation of the N-Queens problem by using Simulated Annealing as a local search algorithm and Min Conflicts as the CSP (Constraint Satisfaction Problem) algorithm.
This repository lists 4 problems solved using C. Each problem has its own serial and parallel implementations. For the latter, the OpenMP API was utilized.
Advanced Data and Algorithms - 4th semester
This project is a simulation of a well known constraint satisfaction problem. It solves it in sudoku and n-queens games.
Genetic optimization implemented in Java.
Algorithmic Puzzles android app
"The classic 'N-Queens problem' is tackled using a variety of advanced techniques such as nested loops, heuristics, backtracking, genetic algorithms, and local search algorithms."
NQueen problem solved using Simple Hill and Restart Climbing Heuristic Algorithm
N Queens Problem - Explanation & Implementation
AI projects on: minimax algorithm, variations of nqueens problem, and policy iteration in Markov Decision Processes
Some basic algorithms learned in 4th semester
Fall 2021 SWE6763 Term Project: A simple NQueens algorithm visualized utilizing Unity
Provide an arrangement of N queens and the program will tell if the provided arrangement satisfies the N-queen arrangement.
N-Queen Problem
This repository solves the 8 Queen Puzzle on a 8x8 chess board and generalises it to a n-Queen Puzzle on n x n
Las Vegas algorithm for the n-queens problem
Add a description, image, and links to the nqueens-problem topic page so that developers can more easily learn about it.
To associate your repository with the nqueens-problem topic, visit your repo's landing page and select "manage topics."