Skip to content

About A Fast And Intelligent Path Finding Algorithm, A*. A* is a weighted algorithm and so that is reason why it completes very long and complex runs in a very-very short period of time. this project is 100% made of pure math logic and pure python.

Notifications You must be signed in to change notification settings

ahmishra/A-Star-Path-Finding-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 

Repository files navigation

A-Star-Path-Finding-Algorithm

A python visualization of the A* path finding algorithm. It allows you to pick your start and end location and view the process of finding the shortest path.

Requirements

Python 3.x
TKinter
Pygame

How Do I Run This Type Of File (*.py) ?

1. Please Run This This Command In Your command line (CMD Or Terminal Respectivly & Assumning You Have git) in a desired path- git clone https://github.com/ahmishra/A-Star-Path-Finding-Algorithm.git

2. The Answer is simple in you command line (CMD Or Terminal Respectivly) type this command (Assuming You Have Python Installed In Your Computer):
Z:SOME-PATH> python Astar.py

Or, Run It In Gitpod-

You can also run A*-Path-Finding in Gitpod, a free online dev environment for GitHub:

Open in Gitpod

Please Note: The GUI is a little glithcy in GitPod. For best results expand the VNC window to be full screen.

For More Information Please Visit Here- https://en.wikipedia.org/wiki/A*_search_algorithm

About

About A Fast And Intelligent Path Finding Algorithm, A*. A* is a weighted algorithm and so that is reason why it completes very long and complex runs in a very-very short period of time. this project is 100% made of pure math logic and pure python.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages