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.

"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."

A N Queens solver using Las Vegas algorithm.

Solve N-Queen Problem by using BFS

Advanced Data and Algorithms - 4th semester

Genetic algorithm

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

N queens problem solution using backtracking.

A Java implementation of solving the N-Queens problem using various search algorithms, including BFS, DFS, A* with different heuristics, genetic algorithm, and particle swarm optimization PSO. The project utilizes Java and JavaFX for the user interface.

C Programs - Simple C programs

An Nqueen algorithm for humans 👸

An implementation of the N Queens Problem in Haskell, C++ and Prolog made for DCC024 - Linguagens de Programação

Executing important algorithms using java

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.