Authors: Jierui Xu, and Edison Chen

Time: Summer 2022

Course: CS 188 Introduction to Artificial Intelligence, taught at UC Berkeley

Achievement: Our team scored 1st out of a total of 5 teams in the final contest.

Multi-Agent Adversarial Pacman Project

Overview

This mini-contest involves a multi-player capture-the-flag variant of Pacman, where agents control both Pacman and ghosts in coordinated team-based strategies. Each team will try to eat the food on the far side of the map, while defending the food on their home side.

Each team's agents are in the form of ghosts on their home side and Pacmen on the opponent’s side. Also, team is now able to eat their opponent when the agent is a ghost. If a Pacman is eaten by a ghost before reaching his own side of the board, he will explode into a cloud of food dots that will be deposited back onto the board.

THe ultimate goal is to reach as much points as possible while keep the other team's points as low as possible. Eventually, the team with highest points win the game.

Score Calculation

The score in this Pac-Man strategy is calculated based on a linear combination of features and their corresponding weights. The primary goal is to maximize the score by considering both offensive and defensive strategies.

Evaluation Function

Features and Weights

Detailed Explanation of Features

Strategy Implementation

The author implements a hybrid strategy that switches between offensive and defensive roles based on the game state:

Offensive Strategy

Defensive Strategy

Differences Between Offensive and Defensive Agents

Offensive Agent

Defensive Agent