Digital Dave

I’ve completed the console A* program. All that needs to be done is some polish for distribution.

As far as the console goes, it’s not incredibly exciting. It’s not exactly feature rich, and it only serves to understand the basis of the artificial intelligence pathfinding algorithm A*.

The map is edited within the compiler. You just change the HEIGHT and WIDTH defines, then modify the 2D array, and you’re set.
1: Wall ; 2: Start Node ; 9: End Node

Then once you cycle through the solution, you’ll be shown the optimal path. Now, as you can see with this example, at about the middle, the path moves up, and then comes back down to a diagonal position (SE). I blame it on the heuristic.
5: Path

I’m going to read some philosophy and then get a distribution ready to fly.  Check back later.