The whole project contains implementation of depth-first, breadth-first, uniform cost, and A* search algorithms. These algorithms are used to solve navigation and traveling salesman problems in the Pacman world. Moreover, the game is modeled as both an adversarial and a stochastic search problem, including implementation of multiagent minimax and expectimax algorithms, as well as designing evaluation functions.
- Project0: http://ai.berkeley.edu/tutorial.html
- Project1: http://ai.berkeley.edu/search.html
- Project2: http://ai.berkeley.edu/multiagent.html