Contain one pre and three times lab
Basic python code
Found paths to reach a particular location and to collect food efficiently using graph search algorithms (BFS, DFS, UCS, A*) and eat all the dots.
Designed agents for the classic version of Pacman zero-sum game, including ghosts. Implemented minimax, alpha-beta, expectimax search and evaluation function.
Implemented value iteration and Q-learning, test agents on Gridworld and applied them to Pacman.