Skip to content

Latest commit

 

History

History
10 lines (7 loc) · 539 Bytes

README.md

File metadata and controls

10 lines (7 loc) · 539 Bytes

A-Star-Sharp

A small, easy to understand C# implementation of the A Star pathfinding algorithm for 2D grid based applications, and games.

In my searching, I couldn't find a very straightforward A Star implementation in C#, so I wrote one.

Code improvements to be made soon:

  1. Add functionality to consider all eight possible adjacent nodes.

For an example of how this is used:

Check out my "prototype" repository, prototype/Engine/AI/Astar.cs, and prototype/Engine/Region.cs is where the grid is built, paths are found, etc.