bytewithahmad/Syntexhub_Maze_Solver_Astar
Artificial Intelligence project implementing the A* pathfinding algorithm in Python to find the shortest path in a maze. Uses Manhattan heuristic for optimal search and visualizes the maze and solution path using NumPy and Matplotlib. as part of the Artificial Intelligence Internship task at Syntexhub.
Stars
1
Forks
—
Language
Python
License
—
Last pushed
Mar 10, 2026
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/bytewithahmad/Syntexhub_Maze_Solver_Astar"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
forestagostinelli/deepxube
Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
algoprog/Laby
Maze generator, editor & solver in Java
VedantKhairnar/The-Maze-Runner
AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze