🔒 Locked

path finding

Started by athos_musketeer Jan 26, 2003 at 9:15 AM 3 replies 300+ views

Original Post

Jan 26, 2003 at 9:15 AM

i''m designing an adventure graphic adventure like the old fashion 2d games, like larry 4-7 or monkey 1-3, etc. my question is this: what should i do to work with the way the hero walk to several places, for instance, if there is a fence in the middle of the screen and the door is in one corner. i want my caracther be smart enough to walk through the door by himself. should i use some map in my screens, kind a rts or do exact pixel?

athos_musketeer

Author

athos_musketeer

Jan 28, 2003 at 9:23 PM

i understand you.
thanks nik..

don''t be alarmed ''cause of your english . i stink too..
haha!! i''m not english.

leeWinder

Jan 30, 2003 at 5:28 PM

Go with the rectangles, but use the A* algorithm to find the distance. Its pretty easy to understand and always generates the shortest route

Timkin

149

Timkin

Jan 30, 2003 at 5:41 PM

A* will return the optimal path if and only if certain conditions are met during implementation. i.e., admissible heuristic and monotonic cost function.

athos: if you need help implementing your pathfinding, drop by the artificial intelligence forum... there are plenty of people there who can quickly answer most questions you might have regarding the problem.

Cheers,

Timkin

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.