https://github.com/dtroupe18/gridworldpathfinder
A* pathfinding in a grid world maze where only straight line moves are allowed. Manhattan distance is used as the heuristic, and various versions of A* were used and analyzed.
https://github.com/dtroupe18/gridworldpathfinder
astar-algorithm gui pathfinding python3
Last synced: 3 months ago
JSON representation
A* pathfinding in a grid world maze where only straight line moves are allowed. Manhattan distance is used as the heuristic, and various versions of A* were used and analyzed.
- Host: GitHub
- URL: https://github.com/dtroupe18/gridworldpathfinder
- Owner: dtroupe18
- Created: 2017-02-13T23:39:48.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2017-12-28T16:14:33.000Z (over 7 years ago)
- Last Synced: 2025-02-08T20:32:46.324Z (4 months ago)
- Topics: astar-algorithm, gui, pathfinding, python3
- Language: Python
- Homepage:
- Size: 1.33 MB
- Stars: 2
- Watchers: 3
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# GridWorldPathFinder
**A star pathfinding in a gridworld maze where only straight line moves are allowed.**The green square is where the agent would start inside the maze. The red square represents the goal state for the agent.
Blue squares are the explored cells, orange cells are the shortest path, and white cells are unexplored.**Sample solution using A star with lower G tie-breaking**
.png)
**Sample solution using A star with higher G tie-breaking**
.png)
**Sample solution using A star with higher G tie-breaking Solving the maze in the forward direction**
.png)
**Sample solution using A star with higher G tie-breaking Solving the maze in the backwards direction**
.png)