Sign in to follow this  

AI Game in J2ME

This topic is 4842 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, i developing the action game in mobile phone and some of the people recommend me using the Pathfinding to create it. However, i can't find any source code about pathfinding which using the J2ME. so that, can u help me find some of the source which using the J2ME to devleop the pathfinding for me. Or u can recommed me using the other way to develop the AI. Pls post some of the source to me. thank u.

Share this post


Link to post
Share on other sites
Pathfinding in J2ME is just like pathfinding on any other platform. There's nothing special about the MIDP or CLDC that makes the algorithms different. So any general documentation on pathfinding should suffice.

Share this post


Link to post
Share on other sites
Quote:
Original post by Sneftel
Pathfinding in J2ME is just like pathfinding on any other platform. There's nothing special about the MIDP or CLDC that makes the algorithms different. So any general documentation on pathfinding should suffice.


While I agree that implementing pathfinding in Java is practically the same thing as in any other language, the fact that the game is for mobile phones may mean that a common algorithm like A* may be too heavy on the resources if the grid is big and/or complicated. Consider pathfinding that moves along "tracks" rather than actually finding the path if the more standard algorithms prove to demanding.

Share this post


Link to post
Share on other sites
Quote:
Original post by Lorgosin
While I agree that implementing pathfinding in Java is practically the same thing as in any other language, the fact that the game is for mobile phones may mean that a common algorithm like A* may be too heavy on the resources if the grid is big and/or complicated. Consider pathfinding that moves along "tracks" rather than actually finding the path if the more standard algorithms prove to demanding.
We've implemented A* on even the crappiest of phones without too much trouble; with standard techniques and data structures the processor and memory consumption is very reasonable. Of course, you're right that it's a bad idea to go with a general algorithm like A* if a more limited, targeted algorithm would serve just as well.

Share this post


Link to post
Share on other sites

This topic is 4842 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.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this