This is an implementation of an n-queens solver, but with additional constraint that there should be no 3 or more queens that align in a straight line.

Artificial Intelligence Course @fmi 2020/2021

N Queens Algorithm Program Using Backtracking In JAVA With All Solutions

Nqueen Game Parallel Version Implementaion

Java implementation for the N Queens problem

Solving the N-Queens problem using a blind and informed (heuristic) search. (School Project - 2017)

Java implementation of a NQueens problem solver, this application gets a size of the NQueens problem to solve and returns how many solutions it found/are possible. Will be extended to returning a solution aswell as/instead of a number

BIL441-Artificial Intelligence-Project 2 Implementation

Returns sets of coordinates where n queens on a n by n chess board can exist in harmony

Enkel lösning på "N Queens"-problemet

N-Queen problem + second implementation so called "Lone" N-Queen were no 3 queens are in a straight line at ANY angle

A generic genetic algorithmes , with mutation, survival and mating selection. Easy to add new type of genes.

N皇后 可自定义棋盘长宽与皇后数量

Solutions to two classic np-complete problems: n-queens and knight's tour.

Solving 8-Queens problem using GA & BT on Android.

A uni project where we implemented blind search as well as metaheuristics approches to solving the NQueens Problem.

In this repository i am going to keep some of the important notes and programs which are most useful while Coding.

Optimized algorithm to find all solutions for the N-Queens-Problem in Java

Hill Climbing and Hill Climbing With Random Restart implemented in Java.