I'm doing a TD and I have basic pathfinding working but I got a problem.
I want to make the path blockable, and when a block occurs the runners will attack the blocking towers.
So what I need is a way to find the path with lowest amount of towers in it(more important), which is the shortest.
How do I do that?
Pathfinding the closest path when there is no path.
Daniel
- 549
- 3
- 11