A demonstration of pathfinding algorithms that show the shortest path between two tiles. The shortest pathway is highlighted in green, and the neighboring tiles are indicated by the floating cylinders when hovering over a tile.
The gif below indicates a consistent set of paths that are the shortest when clicking two different tiles and can be cleared by player input.
During the development of this project, the main issue I encountered was the cost of moving between tiles being the same value, which created irregular pathways that weren't shortest. To fix this issue, each tiles movement cost was given different values.