Click here to Skip to main content
15,887,442 members
Please Sign up or sign in to vote.
5.00/5 (2 votes)
See more:
Im busy working on a top down shooter in XNA and would like to know which is the best pathing algorithm? I have implemented the A* algorithm but this takes a while to calculate the path. Which algorithm do major game developers use in their games?
Posted

you could try using Dijkstra's algorithm some links to help

http://g4ac.co.za/dijkstra[^]

http://g4ac.co.za/wVmcC[^]
 
Share this answer
 
Comments
DominicZA 16-Jul-11 2:53am    
The problem is still the same. It takes time to t, and therefore cause the games to almost "freeze" for a couple of seconds.
P.S, If I'm not mistaken, Dijkstra's algorithm is use for path finding on a map, and I don't think would work too well in a game development environment.
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900