Thomas John Wolfe

A generic version of Astar algorithm I did when in college. Astar is a "shortest path" finding algorithm from State A to State B. This code should apply to any problem that can be solved with Astar pathfinding in C#. The test code uses letters to find the shortest amount of swaps to get from inital state of string A to target state of string B.