An A* algorithm in C#. Original credit goes to Gustavo Franko and his post
on code guru.
With his permission I've pulled out the A* algorithm from the sample app, updated some of
the code to use some newer c# features, added some tests to demonstrate usage and uploaded it to github. You can
view the project at https://github.com/valantonini/AStar.
The algorithm contains a variety options such as whether it uses diagonals.
The grid is represented as a byte array with an open position represented as a 1 and a
blocked position represented as a 0. You can set up a path from a string using the following (where O is open and X is blocked):