The A* Path Finding Algorithm (CSS's Code Repository)
-
CaptainSeeSharp wrote:
Yes, it throws the PathNotFoundException.
But your algorithm makes no mention of the possibility that a path may not be found, or the condition that indicates that no path exists. Thus your algorithm is incomplete.
Bob Emmett CSS: I don't intend to be a technical writing, I intend to be a software engineer.
It is a tutorial for beginners. My intention is to construct a tutorial website, mainly focusing on algorithms and small games that utilize those algorithms. That article is to get your foot in the door with the A* Path Finding Algorithm. I boil it down as simple as I can possibly make it so it is easy to understand. That is more important than listing the infinite details and possibilities. Such things belong is a comprehensive specification. My implementation is a bit more sophisticated, it is part of the GameFX library. It integrates with the TileMap components, and most functions automatically react to events in the TileMap so it is extremely easy to use as a library.
Watch the Fall of the Republic (High Quality 2:24:19)[^] Sons Of Liberty - Free Album (They sound very much like Metallica, great lyrics too)[^]
-
It is a tutorial for beginners. My intention is to construct a tutorial website, mainly focusing on algorithms and small games that utilize those algorithms. That article is to get your foot in the door with the A* Path Finding Algorithm. I boil it down as simple as I can possibly make it so it is easy to understand. That is more important than listing the infinite details and possibilities. Such things belong is a comprehensive specification. My implementation is a bit more sophisticated, it is part of the GameFX library. It integrates with the TileMap components, and most functions automatically react to events in the TileMap so it is extremely easy to use as a library.
Watch the Fall of the Republic (High Quality 2:24:19)[^] Sons Of Liberty - Free Album (They sound very much like Metallica, great lyrics too)[^]
CaptainSeeSharp wrote:
It is a tutorial for beginners.
And, applied to a simple 2D world, A* is a non-complex algorithm and easy for a beginner to comprehend. To present a beginner with a non-functioning algorithm is unhelpful.
CaptainSeeSharp wrote:
That is more important than listing the infinite details and possibilities.
It is a pathfinding algorithm, it either finds a path or it doesn't, hardly infinite.
CaptainSeeSharp wrote:
My implementation is a bit more sophisticated
You mean that it includes the test to ensure that the path returned is actually the shortest?
Bob Emmett CSS: I don't intend to be a technical writing, I intend to be a software engineer.