GitHub / HxnDev / Solving-a-Maze-using-GBFS-and-A-Star
In this, we solved a maze using both Greedy Best First Search Algortihm and A* Algorithm
Stars: 2
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 255 KB
Dependencies parsed at: Pending
Created at: almost 4 years ago
Updated at: 11 months ago
Pushed at: almost 4 years ago
Last synced at: about 1 month ago
Commit Stats
Commits: 4
Authors: 1
Mean commits per author: 4.0
Development Distribution Score: 0.0
More commit stats: https://commits.ecosyste.ms/hosts/GitHub/repositories/HxnDev/Solving-a-Maze-using-GBFS-and-A-Star
Topics: a-star, a-star-algorithm, a-star-path-finding, a-star-search, code, gbfs, gbfs-algorithm, greedy-best-first-search, maze, maze-solver, python