https://github.com/logicjake/a-star-search
visually find the shortest path using A* algorithm
https://github.com/logicjake/a-star-search
astar-algorithm astar-pathfinding pathfinding
Last synced: about 1 year ago
JSON representation
visually find the shortest path using A* algorithm
- Host: GitHub
- URL: https://github.com/logicjake/a-star-search
- Owner: LogicJake
- Created: 2019-01-06T15:01:40.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2019-01-08T05:47:05.000Z (over 7 years ago)
- Last Synced: 2025-03-30T23:41:15.401Z (about 1 year ago)
- Topics: astar-algorithm, astar-pathfinding, pathfinding
- Language: Python
- Homepage:
- Size: 97.7 KB
- Stars: 30
- Watchers: 1
- Forks: 12
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## A-star-search
Visually find the shortest path using A* algorithm.
### how to run it
Better to use python3
#### install requirements
```
pip install -r requirements.txt
```
#### start
```
python main.py
```
### description
* Green block represents starting block
* Blue blocks represent obstacle blocks
* Red block represents finding block
* Blocks with yellow border are in the close list
* Blocks with green border are in the open list
* Arrow inside block points to his parent block
As you can see in the gif, you should click blocks to set starting block, obstacle blocks and finding block. If you don't know what to do, you can read the title on the screen. You can have zero or more than one obstacle blocks, just click until you think the number of obstacle blocks are enough. And then press space key to choose a finding block.
After you choose all blocks, the search will start. You can press space key to step the search.