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.
-
Updated
Jun 18, 2021 - Python
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.
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.
BERKLEY AI PACMAN
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.
Client Server Berkley Algorithm Implementation
Berkeley Pacman Projects and Kakuro solver
Add a description, image, and links to the berkley topic page so that developers can more easily learn about it.
To associate your repository with the berkley topic, visit your repo's landing page and select "manage topics."