N-Queens Solver using Hill Climbing and Genetic Algorithms

N-Queens Solver using Hill Climbing and Genetic Algorithms!

The N-Queens problem is a classic combinatorial optimization problem that challenges us to place N queens on an N×N chessboard in a way that no two queens threaten each other. In this project, I compare two different search algorithms, Genetic Algorithm and Hill Climbing Algorithm, in their approach to solving the N-Queens problem.

Link to GitHub Repo

N-Queens Solver using Hill Climbing and Genetic Algorithms!

Pukoban Solver using BFS, DFS, A*, and Greedy Search Algorithms

Using Machine Learning to Detect Credit Card Fraud

graupe.io