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
A Gobang game (includes a naive AI) based on Min-Max-Search and Alpha-Beta-Pruning algorithm. (by Qt5.11)
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
Submission to the InformatiCup2021 challenge.
UCI Chess Engine
Solutions to problems in classical PDDL (Planning Domain Definition Language) for the air cargo domain
Implementation of Late Acceptance Hill Climbing (lahc) algorithm
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.
A sliding puzzle game and solver using ncurses.
A sliding block puzzle, whose solution is found using A* Search.
A Travelling Salesman Problem (TSP) solver using a hybrid of strategies
A simple Python demonstration of graph search planning strategies
Generate timetables using genetic algorithms
Implementation of the ACO (Ants Colony Optimization) for the traveling salesman problem. JOGL used
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”.
Implementation of Depth First Search, Breadth First Search, Iterative Deepening and A* for solving a puzzle game. This is part of a coursework assignment for Intelligent Systems module (COMP2208 - @ University of Southampton)
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
Add a description, image, and links to the heuristic-search topic page so that developers can more easily learn about it.
To associate your repository with the heuristic-search topic, visit your repo's landing page and select "manage topics."
