This is a comprehensive project for learning how pathfinding algorithms work. In this project, A* is implemented, then optimized by Heap Binary Tree which is much faster than the first implementation.
It also covers, genuin ways of developing and debuging (by using Gizmos) and how to improve fractioned movements, into a smooth one. It also supports running many units on seperate threads.
- Algoritm explained
- Automatic grid generation
- Heap algorithm (optimized version)
- Multiple units can be used
- Unique weights for unique paths
- Smoothed weights (Blur method)
- Smooth movement on path
- Multi-threaded
This project is based on a great tutorial by Sebastian Lague