A powerful, optimized and easy-to-use Java A* Pathfinding Library for 3D environments.

A graphical tool to simulate robot path planning with obstacles using two different algorithms : Dijkstra and A*

Astar (A*) algorithm to find path between two given points

Java and Python implementations of the A* (A Star) path planning algorithm. Includes example test driver command line program.

Usage of A*/Astar algorithm

A Star Algorithm used to route pins using Metal 1, Metal 2 and Metal 3 wires.

Using java i managed to implement AStar algorithm on a map to color each city in a color by taking the shortest way and each neighboring cities have a different color.

Maze is a mini project developed to generate a maze randomly and be capable to resolve it using A* algorithm and Manhattan or Pythagore heuristics.

8 puzzle BFS in Java

This is the implementation of A Star Algorithm using Java

Implementation of A* search using linear distance as heuristic function

A visualization of the A-Star algorithm written both in Python and Java with the use of the Processing library and IDE.

Science Research for students of UNETI 2016

Projeto do NetBeans contendo uma aplicação que permite ao usuário testar o algoritmo A*. O A* é um algoritmo de busca de caminho entre dois pontos a partir de uma malha definida. Nesta aplicação é utilizado o método de Manhattan para realizar o cálculo da heurística.

A star Algorithm in Java

A* (A-star) pathfinding algorithm with demo

COMP4106: Exploring different search methods in order for a cat to catch a mouse before the mouse eats all the cheese