I have completed four Pacman projects of the UC Berkeley CS188 Intro to Artificial Intelligence course. The Pac-Man projects were developed for CS 188. They apply an array of AI techniques to playing Pac-Man. They teach foundational AI concepts, such as informed state-space search, probabilistic inference, and reinforcement learning.

Implementation and statistical analysis of an AI agent capable of winning the arcade game of Pac-Man using an MDP solver that follows a policy based on Value Iteration.

A simple example of a socket client and server (Network/Berkley Sockets).

Utilização dos algoritmos de Bully e Berckley para a sincronização de relógios em processos diferentes.

Berkeley Pacman Projects and Kakuro solver

Client Server Berkley Algorithm Implementation