Shortest Path | GameDev.net

Original Post

177

Feb 3, 2004 at 9:16 PM

Im not sure this is the correct place to post. However I have a group of Objects, and each object is connected from 1 to 6 other Objects. How can I calculate quickly how to get from one Object to another Object passing through the least ammount of other Objects. Hope I explained this clearly. Thanks

SiCrane

Mod

473

SiCrane

Feb 3, 2004 at 9:22 PM

One method is Dijkstra''s Algorithm.

yaroslavd

Feb 3, 2004 at 9:22 PM

Look up A* (pronounced A-star).

Edit:

This was on the front page a couple of days ago: http://gamedev.net/reference/programming/features/astar/

[edited by - yaroslavd on February 3, 2004 10:24:25 PM]

porthios

Feb 3, 2004 at 9:24 PM

I would think a simple pathfinding style algorithm (A-star) would be fine, maybe tweaked a bit.

SelethD

Author

177

SelethD

Feb 3, 2004 at 10:20 PM

ill check those out
thanks

Topic Locked