You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In this project, your Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. You will build general search algorithms and apply them to Pacman scenarios.
In this project, you will design agents for the classic version of Pacman, including ghosts. Along the way, you will implement both minimax and expectimax search and try your hand at evaluation function design.
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.
Explore foundational AI concepts through the Pac-Man projects, designed for UC Berkeley's CS 188 course. Implement search algorithms, multi-agent strategies, and reinforcement learning techniques in Python, emphasizing real-world applications. Engage in the Eutopia Pac-Man contest for a multiplayer capture-the-flag challenge
In this repository, I outline the course lab carried out for the Artificial Intelligence CSE 4617 course along with the lab CSE 4618, conducted by Bakhtiyar Hasan Sir Note: We did not have to implement all of the code but rather portions of the code as outlined by the taskbook in the resources section