A fairly strong revision to more emphasize the goal, especially in the otherwise confusing title. Added the tower-defense tag as well. ♪

Source Link

edit approved Apr 27, 2011 at 13:49

Grace Note ♦

599
6
13

Pathfinding Locate the closestshortest path through obstacles when there is no path.all normal paths are blocked

I'm doingmaking a TDTower Defense and I have basic pathfinding working, but I got a problem.
I

I want to make the path blockable, and when a block occurs the runners will attack the blocking towers. So

So what I need is a way to find the shortest path withthat, more importantly, has the lowest amountnumber of towers in it(more important), which is the shortestway. How

How do I do that?

edited tags

Link

edited Jul 24, 2010 at 16:03

coderanger

6.1k
37
38

algorithm path-finding

Source Link

asked Jul 24, 2010 at 5:56

Daniel

549
3
11

Pathfinding the closest path when there is no path.

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?

algorithm

Stack Exchange Network

Return to Question

Pathfinding Locate the closestshortest path through obstacles when there is no path.all normal paths are blocked

Pathfinding the closest path when there is no path.

Locate the shortest path through obstacles when all normal paths are blocked

Pathfinding the closest path when there is no path.