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!

Implementation of data mining methods that use evolutionary algorithms

AccuSyn: An Accurate Web-based Genome Synteny Browser

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.

Generate timetables using genetic algorithms

Implementation of Late Acceptance Hill Climbing (lahc) algorithm

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

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

UCI Chess Engine

A sliding puzzle game and solver using ncurses.

Learning Discrete World Models for Heuristic Search

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

A simple Python demonstration of graph search planning strategies

In MWVCP, a member of np-complete family, it is required to find the vertex cover of a given graph such that the sum of the weights of the nodes is the minimum. A vertex cover of a graph is “a set of vertices such that each edge of the graph is incident to at least one vertex of the set”.