Implemented the A* Path Finding Algorithm
Able to compute in a 4 or 8 direction mode however there isn't anything to check if you are attempting to move on a diagonal so all movements costs the same.
Need to add a way to explicitly make a node non-traversable, currently you have to tell the node that it is on the closed list when it really isn't
Currently no implementation of the Path class
No way to change the heuristic