Comparison between A-Star and a simple recursive algorithm
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Assets
ProjectSettings
.gitignore
Pathfinding.txt
readme.md
screenshot.jpg

readme.md

Pathfinding Methods Comparison

Comparison of A-Star pathfinding algorithm with a simple recursive algorithm that finds for each node the neighbour with the smallest distance to target. For both methods there are an example in slow motion and one on a terrain. A-Star is the established method to find always the shortest way from start to a given target. The alternative algorithm also finds a way if one exists, but not necessarily the shortest. This method is marginally faster and may be the choice for a more "human" pathfinding.

A working Live Demo of this tool you can find on jojo-studio.de

Screenshot