(Work In Progress)
The Pacman project completed while (informally) doing the CS188 course offered by University of California, Berkeley (Fall '18)
In this project, Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. I built general search algorithms and applied them to Pacman scenarios.
Check out the syntax for running various scripts and games of different sizes and paramenters at: Project 1
In this project, I designed agents for the classic version of Pacman, including ghosts. Along the way, I implemented both minimax and expectimax search and tried my hand at evaluation function design.
Check out the syntax for running various scripts and games of different sizes and paramenters at: Project 2
In this project, I implemented value iteration and Q-learning. I tested the agents first on Gridworld (from class), then applied them to a simulated robot controller (Crawler) and finally to Pacman.
Check out the syntax for running various scripts and games of different sizes and paramenters at: Project 3
Pacman spends his life running from ghosts, but things were not always so. Legend has it that many years ago, Pacman’s great grandfather Grandpac learned to hunt ghosts for sport. However, he was blinded by his power and could only track ghosts by their banging and clanging.
Check out the syntax for running various scripts and games of different sizes and paramenters at: Project 4
A neural network to classify digits, and more!
Check out the syntax for running various scripts and games at: Project 5
Vansh Gupta
Undergraduate student, Electrical Engineering Department
Indian Institute of Technology, Delhi
ReadMe file inspired by the one made by Ke Xu, Jie Zhang. It can be found here