Pathfinding (StevannusLake)

Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. Pathfinding is closely related to the shortest path problem, within graph theory, which examines how to identify the path that best meets some criteria (shortest, cheapest, fastest, etc) between two points in a large network.

Features :

- A* Algorithm

- Dijkstra's Algorithm

- Greedy Best First Search Algorithm

- Breadth First Search Algorithm

This project was created for assignment purpose. The assets in this game are built with zero funding and captured from unity default sprites and self-drawn .