15x15 board with random obstructions using the A* algorithm to find a path between two points

In this project, the A* algorithm was implemented to find a path from any two given nodes in a 15x15 grid with 10% of nodes being non-traversable. If a path can not be found, the program displays a message saying so. If a path can be found, path is printed and visualized.