Areesha-Tahir/GBFS-A_Star-Maze-Slover-In-Python
A program to solve a maze using Greedy Best First Search (GBFS) and A Star algorithm.
This tool helps you find the most efficient path through a maze or grid. You provide a maze layout, and it calculates the shortest route from a starting point to an end point. It's designed for anyone needing to solve pathfinding puzzles or analyze optimal routes in a defined space.
No commits in the last 6 months.
Use this if you need to quickly find the best or shortest path in a labyrinth or a grid-like problem.
Not ideal if your problem involves continuous spaces, dynamic environments, or complex real-world navigation like driving directions.
Stars
11
Forks
—
Language
Python
License
MIT
Last pushed
Jul 15, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Areesha-Tahir/GBFS-A_Star-Maze-Slover-In-Python"
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.
misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
algoprog/Laby
Maze generator, editor & solver in Java
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
VedantKhairnar/The-Maze-Runner
AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze