Skip to content

Ethan830/Artificial-Intelligent-Pacman

Repository files navigation

Artificial Intelligent Pacman

This repository contains multiple AI-powered Pacman projects developed using Python. The goal is to implement and explore fundamental AI concepts such as informed search, multi-agent decision-making, and probabilistic inference — all in the context of the classic Pacman game.


Contents

Proj1: A* Search and Food Collection

  • Implemented A* search with custom heuristics.
  • Designed agents to find optimal paths and efficiently collect food in a maze.
  • Explored suboptimal strategies like greedy food collection.

Proj2: Game Playing with Minimax

  • Built agents using Minimax, Alpha-Beta Pruning, and Expectimax.
  • Developed evaluation functions for smart decision-making.
  • Pacman plays against ghost agents that simulate adversaries or randomness.

Proj3: Sonar Pacman (Ghostbusters)

  • Designed probabilistic agents to track and locate invisible ghosts using noisy distance sensors.
  • Implemented exact inference and belief updates over time.
  • Explored real-world AI concepts like Bayesian reasoning and particle filters.

Proj4: Learning Pacman

  • Implemented model-free reinforcement learning agents (Q-Learning and SARSA) for Pacman, including ε-greedy exploration and temporal difference updates.
  • Designed and tuned feature-based value function approximations to improve generalization across unseen game states.
  • Evaluated agent performance under stochastic environments, analyzing convergence behavior, policy stability, and reward optimization.

Technologies & Tools

  • Python 3
  • Grid-based game engine (provided by UC Berkeley Pacman Projects)
  • Autograder scripts for evaluating correctness and efficiency
  • Command-line based testing with optional graphical output

How to Run

  1. Clone the repository:
    git clone https://github.com/yourusername/artificial-intelligent-pacman.git
    cd artificial-intelligent-pacman

About

Projects exploring AI concepts using Pacman. Includes search algorithms (A*, UCS), multi-agent strategies (Minimax, Alpha-Beta, Expectimax), and probabilistic inference for tracking invisible ghosts.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages