Course Overview An intensive, project-driven exploration of foundational Artificial Intelligence algorithms. The coursework utilized the classic Pacman environment to bridge theoretical AI concepts with practical implementations, covering autonomous planning, decision-making under uncertainty, probabilistic tracking, and modern deep learning architectures.
Core Project 1: State-Space Search & Adversarial Planning Engineered autonomous agents capable of navigating complex deterministic mazes and surviving stochastic, adversarial environments.
Heuristic Search Strategies: Implemented uninformed search (DFS, BFS, UCS) and informed search (A* Search). Designed highly optimized, custom admissible and consistent heuristics to solve complex state-space problems, such as finding the optimal path to consume all food dots and navigating through specific corner coordinates. Adversarial Game Tree Search: Modeled adversarial ghost behaviors by developing multi-agent search algorithms. Implemented Minimax with Alpha-Beta Pruning to drastically reduce the expanded search space, and Expectimax to account for the stochastic, sub-optimal nature of random ghost movements. Designed custom evaluation functions to dynamically weigh game states. Core Project 2: Reinforcement Learning & MDPs Modeled the Pacman environment as a Markov Decision Process (MDP) to develop agents that learn optimal policies through trial and error.
...