Solving N-Queens problem by DFS & BFS in Python.

This is a n-queen problem solver using local search algorithms.

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.

N-Queens GUI solver using A* (A-Star) and Genetic Algorithm.

Full Genetic Algorithm para resolver o problema das N-rainhas

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

Different puzzles to think and enjoy programming.

University project solving n-queen problem using CSP approach

Python, Javascript interview practise.

optimization and palatalization of N queens problem using openmp

Practicals from sem 5 of bsc IT,Third year

Complexity

N-Queens puzzle player. This tool will generate randomly or randomly locked puzzle, you may use this as "a boxing bag" to practice problem solving 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.

N-Queen(s) Problem implemented using Simulated Annealing Algorithm in Python Language

Repositório da disciplina de Inteligência Artificial pela Universidade Federal do Ceará, campus Quixadá

Generic Constraint Satisfaction Problem Solver

Solucion al problema de las N-Reinas en Python para mi asignatura de Algoritmos y Computación (Universidad de Valladolid)

This repository contains implementations of algorithms used for solving various ai related problems

Demonstrate different local search algorithms applied to the 8-queens problem.