In this project, R2-D2 needs to escape from prison of m*n grid, occupied by some obstacles. For R2-D2 to escape it has to push all existing rocks to pressure pads and then search for the teleportal to activate it. This is done by using: a) Breadth-first search. b) Depth-first search. c) Iterative deepening search. d) Uniform-cost search. e) Greedy search with at least two heuristics. f) A* search with two different admissible heuristics.

Built With

Share this project:

Updates