The Berkeley Pacman Projects repository offers a modular Python codebase where users build and test AI agents in a Pacman maze. It guides learners through uninformed and informed search (DFS, BFS, A*), adversarial multi-agent search (minimax, alpha-beta pruning), and reinforcement learning (Q-learning with feature extraction). Integrated graphical interfaces visualize agent behavior in real time, while built-in test cases and an autograder verify correctness. By iterating on algorithm implementations, users gain practical experience in state space exploration, heuristic design, adversarial reasoning, and reward-based learning within a unified game framework.