UC Berkeley CS188 Intro to AI
Introduction These projects are from UC Berkeley CS 188
There are 2 different projects in this repository.1st project is about search and 2nd project is about reinforcement learning.
In 1st project, the Pacman agent will find paths through his maze world which is based on search algorithms such as DFS , BFS, UCS, ASTAR. To understand the mechanism, the tiny maze is used and simple run the pacman.py.It will open automatically the tinymaze map and agent will find its path base on dfs algorithm.The analysis of this search in tinymaze is written in this figure
To run the pacman in console, please remove the code below from the pacman.py
input_parameters = ['-l', 'bigMaze', '-z', '.5', '-p', 'SearchAgent', '-a', 'fn=dfs']
python pacman.py -l bigMaze -z .5 -p SearchAgent -a fn=dfs
python pacman.py -l bigMaze -p SearchAgent -a fn=bfs -z .5
python pacman.py -l bigMaze -p SearchAgent -a fn=ucs
python pacman.py -l bigMaze -z .5 -p SearchAgent -a fn=astar,heuristic=manhattanHeuristic- DFS, BFS, UCS, ASTAR, ASTAR heuristic
python pacman.py -l bigMaze -z .5 -p SearchAgent -a fn=dfs
python pacman.py -l bigMaze -p SearchAgent -a fn=bfs -z .5
