danyalimran93/Artificial-Intelligence-State-Space-Search
Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination
This project helps computer science students and AI enthusiasts understand and visualize different search algorithms. It takes a 2D grid with a defined start and end point and outputs the optimal path and its cost. Users who are learning about artificial intelligence pathfinding or need to demonstrate search algorithm behavior would find this useful.
No commits in the last 6 months.
Use this if you are a student or educator looking to explore and compare how different AI search algorithms find the shortest path in a grid.
Not ideal if you need a solution for complex, real-world navigation or routing problems with dynamic obstacles and large-scale maps.
Stars
26
Forks
12
Language
Java
License
—
Last pushed
Aug 27, 2017
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/danyalimran93/Artificial-Intelligence-State-Space-Search"
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
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
algoprog/Laby
Maze generator, editor & solver in Java
tekian/path-finder
Visualization tool to demonstrate how different search algorithms work.