andrewhummus / astar-pathfinding Goto Github PK

A start pathfinding visualiser in python.

This is the first attempt I implemented the a-star pathfinding algorithim, I created the visualiser with pygame. Although Big props to @Techwithtim for having an amazing tutorial on the algorithim.

You must create a map to start the pathfinding! The start node is orange, end node is turqoise and the walls/drawing are black.

To create nodes:

• Left click (Create the start node with left click, Then the end node with left click)

To delete nodes

• It is the same as creation, Except right click!

Note: Unfortunately My algorithm does not support diagnol path finding, Only non diagnol path finding.

A start pathfinding visualiser in python.

This is the first attempt I implemented the a-star pathfinding algorithim, I created the visualiser with pygame. Although Big props to @Techwithtim for having an amazing tutorial on the algorithim.

You must create a map to start the pathfinding! The start node is orange, end node is turqoise and the walls/drawing are black.

To create nodes:

• Left click (Create the start node with left click, Then the end node with left click)

To delete nodes:

• It is the same as creation, Except right click!

Each color represents something in the program.

• Red (Checks if its closed if the color is read)
• Green (If open the color is green)
• Black (if there is a barrier for the path it will be black)
• Turqoise (Represents the end of the path finding, this will show up if that path gets found)
• White (Represents if the path is reset)

This list isn't exhaustive, But shows the most important colors.

Note: Unfortunately My algorithm does not support diagonal path finding, Only non diagonal path finding.

https://github.com/andrewnijmeh/astar-pathfinding/blob/main/Screenshots/screen.gif

a project by Andrew Nijmeh.