Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. It's include Depth First Search, Breadth First Search, Uniform Cost Search and A* Search.
Implementing both minimax and expectimax search to eat the beans and avoid collision with ghosts.
Details
Implementation of value iteration and Q-learning.
https://github.com/Nick-liu666/ENSE-496AC-Lab-Pac-Man/blob/main/Lab3-reinforcement/Lab%203.pdf
