Sokoban Solver
[code]
This was a group project I had worked on as part of my graduate-level Artificial Intelligence course. The goal was to build a system to solve Sokoban, a transporation-puzzle where a single agent has to move n boxes to their respective locations. We built a system using different search strategies such as A*, Iterative Deepening A*, Breadth First Search, and heuristics such as the Manhattan distance.
The report and the presentation from the project can be viewed/downloaded below:
The code for the entire project can be found here.