Skip to main content


Showing posts from July, 2017

Adventure Game #002: A* Pathfinding

A* Pathfinding is kinda an essential to the gaming world, it lets you player move around, it helps AI both in NPC and Enemies, it can help validate paths, mazes, and dungeons, etc. so naturally Pathfinding is something that I had to implement. Years ago in college I developed the algorithm for A* Pathfinding, however it was more of an theoretical exercise than a piece of code I could use, so with the help of and my old notes I put this together! The code is simple, give the object a 2D char array, the start location, and the end location and it will spit you out a node with a recursive parent to take you to the end location. Assumptions: Diagonal movement costs 1.4 vertical/horizontal movement cost 1 Limitations: Maps only work with (0,ymax) as the top left corner and (xmax,0) as the bottom right corner ArgumentOutOfRangeException if the end point is unreachable These limitations will be solved in the next iteration of the A* Pathfinding post s = start o =