danyalimran93/Artificial-Intelligence-State-Space-Search
Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination
Implements pathfinding on N×M grids using distinct data structure strategies: DFS/IDS leverage stack-based recursion, BFS uses queue-based traversal, while Greedy and A* employ priority queues with heuristic evaluation. Accepts custom test cases via formatted input files and demonstrates comparative time complexity across all five algorithms on identical grid configurations. Designed as an educational resource for understanding trade-offs between uninformed search (DFS, BFS, IDS) and informed search methods (Greedy, A*) in state-space exploration.
No commits in the last 6 months.
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.
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