Skip to content

A* (A-Star) algorithm for finding the shortest path in a maze

Notifications You must be signed in to change notification settings

MorvanZhou/A-star-maze

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A-star-maze

A python implementation of A* (A star) algorithm for find a shortest path in a maze.

demo

python3 main.py --width 10 --height 8 

After the window shows up, first click a square to select start point, then select an end point, then the position to put walls. Lastly, hit space key and wait for a solution.

About

A* (A-Star) algorithm for finding the shortest path in a maze

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages