A* Search Algorithm

A code-along from Tech With Tim's YouTube video that uses the A* Search Algorithm to find the shortest path between two user-selected points on a grid.

Installation

• fork and clone this repository
• cd into repository
• pipenv install -r requirements.txt

Instructions

• python astar.py
• First left-click - starting square (orange by default)
• Second left-click - end square (turquoise by default)
• Subsequent left-clicks - barrier squares that block off the route (black by default)
• Right click - un-colour any square
• Space Bar - start
• c - restart