Moving by predefined weaypoints about l1-path-finder HOT 4 CLOSED

And if you don't have different movement costs for edges, you can use Breadth First Search instead of Dijkstra's Algorithm. Demo: http://www.redblobgames.com/pathfinding/tower-defense/

from l1-path-finder.

For a tower defense game you might want to consider using Dijkstra's algorithm to compute all single source shortest paths, then have each unit follow along the path tree to get to the root node. If you precalculate this data once, then you can just store it and get the movement for each unit in O(1) time.

from l1-path-finder.

Thank you !

from l1-path-finder.

Thank you @redblobgames ! bfs looks simple, i'll try implement it. What the better way to visualize it ?

from l1-path-finder.