There are 6 repositories under heuristic-search topic.
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.
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.
Solutions to problems in classical PDDL (Planning Domain Definition Language) for the air cargo domain
A sliding puzzle game and solver using ncurses.
Multi robot path planning algorithms implemented in MATLAB. Including heuristic search and incremental heuristic search methods. MRPP or MAPF
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
Generate timetables using genetic algorithms
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”.
A Travelling Salesman Problem (TSP) solver using a hybrid of strategies
A sliding block puzzle, whose solution is found using A* Search.
Implementation of the ACO (Ants Colony Optimization) for the traveling salesman problem. JOGL used
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)
This is the midterm project for the course Software Development in Robotics (ENPM808X) at the University of Maryland.
Attempts to solve the 8-Puzzle by using various heuristic search methods. Written in Python.
Implementation of A* to solve the 8 tile puzzle in prolog.
This will help in visualizing different path-finding algorithms.
[Python] Implementação de modelos matemáticos para a resolução do jogo 8Puzzle utilizando busca heurística, hillclimb e A*.
Script + utility for bots to play NES Tetris on the FCEUX emulator.
A 2 dimensional implementation of two famous heuristic search algorithms; Algorithm I* and PNBA*
Non-optimized implementations of algorithms discussed in the course "planning and heuristic search" at Paderborn University (WS 2018/19).
Optimization of Conference Schedule using AI search methods
Implementation of Max problems: Grid, SIB, MASIB