A visualization of the A* pathfinding algorithm

This program implements and visualizes the A* pathfinding algorithm with a constant cost of 1 between every adjacent square. You can add black squares with the GUI by clicking on the grid. Read more about the A* algorithm here.

Screenshots

How to Run

1. If you don't already have Python 3 installed on your computer, you should install it as described here.

2. In a terminal, clone this repository in a directory of your choice.

   $ git clone https://github.com/tatemunnich/pathfinding.git

3. In the terminal, change to the directory you just cloned and run main.py using Python 3.

   $ cd pathfinding
   $ python3 main.py