The goal of this project is to implement an A* pathfinding algorithm to find the shortest path between two points on a grid.
Our program considers simple environments and more complex ones such as perfect mazes, as well as impossible paths.
| Name | Name | Last commit date | ||
|---|---|---|---|---|