This week's book giveaway is in the JavaScript forum.
We're giving away four copies of JavaScript Promises Essentials and have Rami Sarieddine on-line!
See this thread for details.
The moose likes Game Development and the fly likes path finding Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of JavaScript Promises Essentials this week in the JavaScript forum!
JavaRanch » Java Forums » Java » Game Development
Bookmark "path finding" Watch "path finding" New topic
Author

path finding

wong lavender
Greenhorn

Joined: Nov 30, 2013
Posts: 1
I have two set of arraylist, respectively storing the ground coordinate and wall coordinate. My car can move on the ground coordinate only.

The coordinate in the ground and the wall is randomly generated and is in double type.

I get the starting coordinate and destination coordinate and I need to move the car from the starting point to the destination... and at this time, shortest path is not necessary. I have researched that i could use the a* search algorithm or bfs algorithm but it seems too complex to me... could anyone suggest me easier method to get the path?

i also have difficult to figure out how to find the adjacent coordinate of my starting point? is there any advice? as i think i couldn't just simply check like (x+1, y), (x, y+1)....etc if (x,y) is my starting point.

Thank you for your help.

p.s. i am a rookie to game programming
 
I agree. Here's the link: http://aspose.com/file-tools
 
subject: path finding