Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md
eightpuzzle.py		eightpuzzle.py
game.py		game.py
game.pyc		game.pyc
ghostAgents.py		ghostAgents.py
ghostAgents.pyc		ghostAgents.pyc
graphicsDisplay.py		graphicsDisplay.py
graphicsDisplay.pyc		graphicsDisplay.pyc
graphicsUtils.py		graphicsUtils.py
graphicsUtils.pyc		graphicsUtils.pyc
keyboardAgents.py		keyboardAgents.py
keyboardAgents.pyc		keyboardAgents.pyc
layout.py		layout.py
layout.pyc		layout.pyc
maze.png		maze.png
pacman.py		pacman.py
pacman.pyc		pacman.pyc
pacmanAgents.py		pacmanAgents.py
pacmanAgents.pyc		pacmanAgents.pyc
partners.txt		partners.txt
pleasegrade.txt		pleasegrade.txt
search.py		search.py
search.py.mine		search.py.mine
search.py.r680		search.py.r680
search.py.r694		search.py.r694
search.pyc		search.pyc
searchAgents.py		searchAgents.py
searchAgents.pyc		searchAgents.pyc
textDisplay.py		textDisplay.py
textDisplay.pyc		textDisplay.pyc
util.py		util.py
util.pyc		util.pyc

Repository files navigation

AI-Project1

Implement DFS,BFS,A* Search

About

I have used informed and uninformed searches to find the optimal path in the pacman-food-maze. The search algorithms used are A*(A star) graph search, Greedy search, Depth first search, Breadth first search and Uniform cost search.