Skip to content

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

License

Notifications You must be signed in to change notification settings

davecusatis/A-Star-Sharp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

About

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

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages