A Java library of Customizable, Hybridizable, Iterative, Parallel, Stochastic, and Self-Adaptive Local Search Algorithms

Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.

Solving Knapsack 0/1 problem with various Local Search algorithms like Hill Climbing, Genetic Algorithms, Simulated Annealing, Tabu Search

Hill Climbing / Simulated Annealing / Genetic / ...

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

An Android App that solves the TSP using three different algorithms from the machine learning field.

Example programs for usage of the Chips-n-Salsa library

local search and optimization algorithms are used in AI with a map coloring example | AI course - Fall 2018

Solving Shelf Assigning Problem with Hill Climbing, Simulated Annealing and Genetic Algorithms

La résolution du problème de 8 reines avec l'algorithme HillClimbing

Projet d'intelligence artificielle M1 MIAGE DAUPHINE

Generic implementation of AI local search algorithms with sample problems

Enigma machine simulator + cipher breakers

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

Solving algorithms on N queens problem

Mobile game, parody on Hill Climbe Racing

This includes heuristic algorithms for solving search and optimization problems, such as hill climbing, meta heuristics, evolutionary algorithms, etc.

The objective of this project is to solve a problem of a Distributed File System using two local search algorithms. Hill Climbing Simulated Annealing

This app calculate the optimized route between multiple locations added by user on google maps. stating position and ending position remains same. It gives you a optimized sequence of places to travel so that all places could be covered in minimum distance exactly once. This project is sub part of my another project Carbon Footprint Calculator.

Implementation of Hill Climbing algorithm to Traveling Salesman Problem