A simple library that uses the A* path finding algorithm to find paths on 2D grids.
Size gridSize = new Size(45, 20);
Point startPoint = new Point(0, 0);
Point endPoint = new Point(gridSize.Width - 1, gridSize.Height - 1);
List<Point> wallPoints = new List<Point>();
Random random = new Random();
for (int i = 0; i < gridSize.Width * gridSize.Height * 0.3; i++) // Create random walls points.
wallPoints.Add(new Point(random.Next(gridSize.Width), random.Next(gridSize.Height)));
IGridAstar gridAstar = new GridAstar(gridSize, startPoint, endPoint, wallPoints);
gridAstar.FindPath();
List<Point> pathPoints = gridAstar.Path;Gray = walls
Blue = closed set
Green = open set
Yellow = path
