Awesome Artificial Intelligence Projects

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.

Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem

C++ Gomoku with a strong AI based on minimax search and alpha-beta pruning with Qt5 GUI. *Dozens of C++ tricks & hacks are used to improve efficiency.* Come and try to see if you can beat the powerful AI!

A curated list of online resources for probabilistic planning: papers, software and research groups around the world!

AccuSyn: An Accurate Web-based Genome Synteny Browser

Implementation of data mining methods that use evolutionary algorithms

Single robot path planning algorithms implemented in MATLAB. Including heuristic search and incremental heuristic search methods. A*, LPA*, D*Lite

As alternative heuristic techniques; genetic algorithm, simulated annealing algorithm and city swap algorithm are implemented in Python for Travelling Salesman Problem. Details on implementation and test results can be found in this repository.

Submission to the InformatiCup2021 challenge.

Implementation of Late Acceptance Hill Climbing (lahc) algorithm

Solutions to problems in classical PDDL (Planning Domain Definition Language) for the air cargo domain

Multi robot path planning algorithms implemented in MATLAB. Including heuristic search and incremental heuristic search methods. MRPP or MAPF

UCI Chess Engine

A sliding puzzle game and solver using ncurses.

8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.

A Travelling Salesman Problem (TSP) solver using a hybrid of strategies

A sliding block puzzle, whose solution is found using A* Search.

Generate timetables using genetic algorithms

This is the midterm project for the course Software Development in Robotics (ENPM808X) at the University of Maryland.