🔍🤖 Help R2-D2 Escape
An online AI game that uses advanced search algorithms to help R2-D2 escape from a grid-based prison by activating a teleportal.
Achievements
Initial release of the Help R2-D2 Escape game, showcasing advanced AI search algorithms.
Best Game Award
Awarded Best Game of the Class at the German University in Cairo (GUC) in the AI course during post-grad studies.
𝗦𝗶𝘁𝘂𝗮𝘁𝗶𝗼𝗻
In a galaxy embroiled in civil war, R2-D2 must escape from a grid-based prison on the Death Star by activating a teleportal.
𝗧𝗮𝘀𝗸
Develop an AI-driven game that uses search algorithms to navigate R2-D2 through a grid, pushing rocks onto pressure pads to activate a teleportal.
𝗔𝗰𝘁𝗶𝗼𝗻
Implemented a variety of search algorithms to solve the problem of navigating the grid, including:
- **Breadth-First Search (BFS)**: Explores all possible paths level by level, ensuring the shortest path is found.
- **Depth-First Search (DFS)**: Dives deep into each path, backtracking when necessary.
- **Iterative Deepening Search (IDS)**: Combines the benefits of BFS and DFS by incrementally deepening the search.
- **Uniform-Cost Search (UCS)**: Considers the cost of each path, ensuring the least costly path is chosen.
- **Greedy Search**: Uses heuristics to prioritize paths that seem promising, with at least two heuristic functions implemented.
- **A* Search**: Combines the cost of the path and heuristic estimates to find the most efficient path, with at least two admissible heuristics.
𝗥𝗲𝘀𝘂𝗹𝘁
The game provides an engaging and educational experience, demonstrating the power of AI search algorithms in solving complex navigation problems.