UC Berkeley CS188 Intro to AI -- Pacman Project Solutions
- Finding a Fixed Food Dot using Depth First Search
- Breadth First Search
- Varying the Cost Function
- A* search
- Finding All the Corners
- Corners Problem: Heuristic
- Eating All The Dots
- Suboptimal Search
- Minimax
- Alpha-Beta Pruning
- Expectimax