This repository contains a solution to the classic Eight Queens Puzzle, a combinatorial problem where the objective is to place eight queens on a standard chessboard (8x8) so that no two queens threaten each other. This means that no two queens can share the same row, column, or diagonal.
Inteligent self-learning game in develop
My MAX-SAT solver uses stochastic local search, tabu search, and simulated annealing.
A remake of the Flappy Bird game with Artificial Intelligence developed as a project for the Fondamenti di Intelligenza Artificiale (Fundamentals of Artificial Intelligence) course, part of the Computer Science Bachelor's Degree program at the University of Salerno
Implementation of famous search algorithms for the N-Queen problem.
implement simulated annealing to solve the Traveling Salesman Problem between US state capitals
Repository contains object oriented implementation of Unified Differential Evolution (UDE) inspired by a paper by Ji Qiang and Chad Mitchell
Add a description, image, and links to the stochastic-hill-climb topic page so that developers can more easily learn about it.
To associate your repository with the stochastic-hill-climb topic, visit your repo's landing page and select "manage topics."