Jump to content
  • Advertisement

Archived

This topic is now archived and is closed to further replies.

ServantOfGlaaki

[java] The A* Algorithm

This topic is 5998 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi folks For my current game, I need to implement the A* algorithm - I''m making a point and click adventure game, so when the user click somewhere, my character needs to move there. But the thing is, with the size (a minimum of 320x200) of the graphics, I will have a minimum of 64,000 nodes at one time; one hell of a lot. Is there any solution i could use that would be fast enough? It''''s over for now... until yesterday begins again... tomorrow... tomorrow... tomorrow... [Powerman 5000 - Watch the Sky for Me]

Share this post


Link to post
Share on other sites
Advertisement
Split the areas into section inside which the user can go to anywhere from anywhere by just following a straight line. Then use those sections as nodes in the A* algorithm.

Share this post


Link to post
Share on other sites
Anyone know where I might find a good A* tutorial? (I''ve googled it but most articles I have found are rather lacking in application etc.) Thanks!

-------------------------
Every servant has his place, no matter lowly or modest. To know it is his greatest comfort, to excel within his greatest solace, and his master''s contentment is his greatest reward.
-
Serve Microsoft today, tomorrow you may be dead.

Share this post


Link to post
Share on other sites

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!