09-23-2004, 07:52 AM | #1 |
Rubber chicken
|
Adventure game walking algorithms?
Sense I think there are alot of people here who probably has programmed one or two adventuregames I wonder if anyone could recommend any good links where I can find information on mathematical algorithms often used in adventure games especially about how to asign where a character can/can't walk and how to move the player if you press on a certain point... thanx!
|
09-23-2004, 08:05 AM | #2 |
Lurker
|
Google for A* ("a-star") or Dijkstra's Algorithm; those are the two most common algorithms used in games (and not just adventure games).
|
09-23-2004, 11:52 PM | #3 | |
Programmer
|
Quote:
Then you can just use whatever search algorithm you fancy, be it A*, Breadth First Search, etc. www.gamedev.net has plenty of pathfinding tutorials and so does Google Good luck |
|
|