Jump to content
  • Advertisement
Sign in to follow this  
Eldritch

Pathfinding for Symbian game

This topic is 4606 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

I have been looking at various pathfinding algorithms (A*, BFS and Dijkstras), because I need one for my Symbian game. Though, the problem is that they are far too advanced for a Symbian app, since Symbian is such as limited system in terms of system resources. I am therefore wondering, if there is any pathfinding algorithm that might work for a Symbian game. The game is built up using an 11x13 grid of tiles.

Share this post


Link to post
Share on other sites
Advertisement
With just an 11x13 grid I have trouble believing that A* is too much for the Symbian to handle. If you could tell us more about the game though, we might be able to offer a more specialized solution.

Share this post


Link to post
Share on other sites
Well for one, what problems are you having?

A* is an extremely quick, low requirement algorithm, and runs fine on my Palm pilot..

Share this post


Link to post
Share on other sites
No problems so far. I am worried that it won't work on such a limited system, but if you say it should work, I'll give A* a try (done it before for a Windows game) :)

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • 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!