Skip to content

An python script that simulates and show the working progress of a A* pathfinder algortihm.

Notifications You must be signed in to change notification settings

JPVercosa/AStar-Pathfinding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

A* Pathfinding Algorithm Simulation

This repository contains a Python script that demonstrates the A* pathfinding algorithm using PyGame.

Features

  • Grid Setup: Create a grid where you can select a start and end point.
  • Barrier Creation: Draw barriers on the grid to create obstacles.
  • Pathfinding Visualization: Press SPACE to visualize the A* algorithm finding the shortest path between the selected points.

Usage

Run:

python astar.py
  1. Set up the grid and choose the start and end points.
  2. Draw barriers on the grid.
  3. Press SPACE to start the pathfinding simulation.

Requirements

  • Python
  • PyGame

Explore the code and see how the A* algorithm navigates the grid in real-time!

For more details, visit the repository.

About

An python script that simulates and show the working progress of a A* pathfinder algortihm.

Topics

Resources

Stars

Watchers

Forks

Languages