You must sign in before using shopping cart.Sign In
Grid pathfinding with Breadth First, Dijkstra, A* (A star), and Greedy Best-First
Pathfinding provides the ability to find viable paths to a destination using algorithms. This Blueprint explores how different algorithms, heuristics, and rules affect search and movement between graph nodes on a regular grid in search of the final destination.
Seeing the algos run in a delayed psuedo-loop lets you visualize how efficient or effective pathfinding settings really are, with stats to back it up. The results of different combinations may surprise you.
Number of Blueprints: 1
Network Replicated: No
Supported Development Platforms: Desktop, consoles and mobile
Supported Target Build Platforms: Desktop, consoles and mobile
Documentation: Comments in Blueprint