A* pathfinding demo

Thanks to zenteo's idea of merging a 2D array into a 1D list, I can now do pathfinding with nodes

The A* (pronounced A star) pathfinding algorithm basically has the computer calculate a path from one position to another by itself AND have it avoid obstacles . It's not all that complicated, however in Alice it is (because I have a limited use of arrays, classes, etc.).

First version is out. It's got a few bugs in it and is very slow, so I doubt anyone would want to implement it into something at the moment. This one shows an example of a bug and it's slowness (it should complete in about 105 seconds from the time play is pressed).

Finished the main search algorithm, now I need to modify how it reconstructs the path it's made (the way I did it didn't work the way it was supposed to )

Unfortunately, I had to deprecate a few things in order to make it work properly, including the array merging. Apparently, there's a bug with the "last item in list" function; it always returns NaN or null.

Now I just need to figure out where I put my reference for reconstructing .

Finished! Just got to do some testing and cleaning up and then I'll upload

Originally Posted by Niteshifter

Finished! Just got to do some testing and cleaning up and then I'll upload

Sounds cool.

Uploaded first version.

[jediaction]

i did not get what to do