 |
|
|
|
|
|
||
|
|
||
|
|
||
|
|
|
|
|
|
||
|
|
||
|
|
||
|
|
|
|
|
|||||||||||||||||
Add Forum to Favorites | Send Topic To a Friend | View Forum FAQ | Track this topic |
Last Thread Next Thread |
| A* Pathfinding for Beginners |
|
 |
swiftcoder Member since: 7/3/2003 From: Boston, MA, United States |
|||
 Posted - 10/9/2003 10:25:30 AM |
||||
| Nice article, very clear and concise, thanks! ------------------------------------------- Here's to the crazy ones, the misfits, the rebels, the troublemakers, the round pegs in the square holes, the ones who see things differently. ------------------------------------------- |
||||
|
||||
|
thec Member since: 10/25/2002 From: Sweden |
|||
 Posted - 10/10/2003 3:56:36 PM |
||||
| Oh, that images really make me wanna do something better for my future articles. Thanks for describing A* in such an elegant way Albert "thec" Sandberg |
||||
|
||||
|
Melekor Member since: 5/3/2003 From: Vancouver, Canada |
|||
|
Posted - 10/11/2003 11:38:33 AM |
||||
| This is an excellent article! I had never done any pathfinding before, but after reading this article I was able to understand and implement the A* method and I'm already getting ideas about terrain weighting and stuff. Thank you so much! |
||||
|
||||
|
AgentSmith Member since: 10/18/2003 |
|||
|
Posted - 10/18/2003 8:01:25 AM |
||||
| An excellent and well-written article, the perfect introduction into one of the harder parts of game development to get your head around. |
||||
|
||||
|
Seriema Member since: 6/15/2001 From: Stockholm, Sweden |
|||
|
Posted - 10/19/2003 10:31:08 AM |
||||
| Great article! thanx for writing it!  }-- Programmer/Gamer/Dreamer --{ |
||||
|
||||
|
janoh Member since: 4/4/2000 From: Romania |
|||
|
Posted - 10/28/2003 12:24:49 PM |
||||
| Very well written article. I really appreciate it and it's valuable. |
||||
|
||||
|
turtle1776 Member since: 4/14/2002 From: Annapolis, USA |
|||
|
Posted - 11/5/2003 2:09:24 PM |
||||
| It has been brought to my attention that the method used for calculating H in this article is inadmissible. As a result, while the method will almost always give the shortest path, it may not in all situations (though in such cases it will come close). Technically, the Manhattan method would be admissible had it been a 4-way pathfinding example, instead of an 8-way pathfinding example The latest version of this article, which notes this and includes a few other changes, can be found here: http://www.policyalmanac.org/games/aStarTutorial.htm And thanks for the kind remarks! - Patrick Lester [edited by - turtle1776 on April 21, 2004 11:29:57 PM] |
||||
|
||||
|
Anonymous Poster |
|||
Posted - 4/7/2005 5:28:27 AM |
||||
| great thanks !!! |
||||
|
||||
|
turtle1776 Member since: 4/14/2002 From: Annapolis, USA |
|||
|
Posted - 7/18/2005 4:52:39 PM |
||||
| Another correction: In the version of the article here on Gamedev, the method says you can stop the search when the target node is added to the open list. Really, you should wait until it is added to the closed list. This correction has been made to the version of the article found at: http://www.policyalmanac.org/games/aStarTutorial.htm Permission is granted to GameDev to transfer the latest (July 18, 2005) version of the article here. |
||||
|
||||
|
suliman Member since: 5/19/2004 From: Stockholm, Sweden |
|||
|
Posted - 3/17/2006 6:53:23 AM |
||||
| Hi When trying to run the code, the compiler dont regognise among other things this: "lpdirectdrawsurface7" It does find ddraw.h, but its from the package dxsdk_feb2005.zip. Could there be a compatible problem or did i forget to include something? This package is newer then the dx7 package suggested by the author of the article. Thanks a lot for any clearification. |
||||
|
||||
|
burakkilic Member since: 11/14/2006 From: istanbul |
|||
|
Posted - 11/14/2006 5:33:55 PM |
||||
| I used this in my term project, which was Maze(police and thief). I used that algorithm for police. But I have a question now. Can I use the same algorithm for the thief? I mean, I will try to find the longest path to the police,so the target will be the police. And i will choose that road to find the loops. But is it ok? can anyone help me? Thank u for this wonderful tutorial. Helped me so much.. |
||||
|
||||
|
stroma Member since: 5/28/2004 From: Ankara, Turkey |
|||
|
Posted - 11/25/2006 3:28:55 PM |
||||
Quote:i didnt try but, cant you calculate a* for the positions and current position that thief may go, then select the longest one to move him; so that the police's road doesn't get shorter. because of it may make endless loop with certain positions, you can calculate and use paths at different random frequencies. i mean not at every cycle. |
||||
|
||||
| All times are ET (US) |
Last Thread Next Thread |
|
