Skip to content

(A* Algorithm) Search for the lowest cost path to reach from point A to point B.

Notifications You must be signed in to change notification settings

renanbtm/optimal_path_finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

A* path finder

Search for the lowest cost path to move from point A to point B.

Requirements

pygame, numpy

Instructions

  • Set the GUI parameters such as width, height, square size.
  • You can set the start and end point locations, just insert a tuple with the coordinates in the object instantiation. The default value for them is top left corner and bottom right corner, respectively.
  • Draw obstacles with the mouse or press "R" to generate random obstacles.
  • Remove an obstacle by placing the mouse pointer over it and pressing "C" or clear the whole grid pressing "Esc".
  • Press "Space" when you are ready to go. If there is a possible path, it will be drew in blue.

Pathfinder image

About

(A* Algorithm) Search for the lowest cost path to reach from point A to point B.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages