A* Pathfinding stuffs

So i'm rather bored and getting back to some pathfinding code for TGE. For my project i can't use pregenerated paths due to the fact this is for a battle system. With multiple characters moving around, can't have paths created ahead of time.

As stated in the title it's A* pathfinding using binary heaps. Currently you'll need to provide the code an array stating walkable areas and unwalkable areas, a start xy and end xy, and it will give you a path consisting of another array of sqaures that will be your path. From there you can dynamically generate a path using those squares converted to a vector to represent your "real world" coords.

I was curious how many people actually need such a setup? I may get around to releasing the code if others are interested.


[EDIT - Added Some Pics]





Here's some images of my nights work. It randomly generates an area of walkable, and not walkable areas. You can edit these as you wish with clicking and dragging. Then you enter pathfinding mode, where you click a start and end position. and wham. it generates a path.

So what use is this? well this grid i created was just for a personal graphical reference. But you can generate the "map data" from whatever method you choose to represent paths on whatever type of environment you are using.

So for me, i plan on having multiple characters running about, so for this to work well, i'd simply need to modify the map data each time a character moves to a new square. this way there won't be any intersecting paths between moving characters.


This pathfinding is very quick. my attempts at getting a time in MS just seems to give me a 0ms search time. maybe i'm doing it wrong.


subvoicestudios.com/~ramensama/Pathfinding_Test_1.0.zip


By default it will generate a map on it's own, and put you into pathfind mode, so you can start clicking and right clicking. if you want to modify the map, open the console and type PathFindMode();