pacman-ai-search

This repository contains solutions to the Pacman AI Search problems. The search problem includes implementation of uninformed search algorithms like depth-first search (DFS), breadth-first search (BFS), uniform cost search, and A star search algorithms. These algorithms are used to solve navigation and traveling salesman problems in the Pacman world.

More information regarding this project can be found at UC Berkeley's Project page.

Name		Name	Last commit message	Last commit date
Latest commit History 16 Commits
layouts		layouts
test_cases		test_cases
LICENSE		LICENSE
README.md		README.md
VERSION		VERSION
autograder.py		autograder.py
commands.txt		commands.txt
eightpuzzle.py		eightpuzzle.py
game.py		game.py
ghostAgents.py		ghostAgents.py
grading.py		grading.py
graphicsDisplay.py		graphicsDisplay.py
graphicsUtils.py		graphicsUtils.py
keyboardAgents.py		keyboardAgents.py
layout.py		layout.py
pacman.py		pacman.py
pacmanAgents.py		pacmanAgents.py
projectParams.py		projectParams.py
search.py		search.py
searchAgents.py		searchAgents.py
searchTestClasses.py		searchTestClasses.py
submission_autograder.py		submission_autograder.py
testClasses.py		testClasses.py
testParser.py		testParser.py
textDisplay.py		textDisplay.py
util.py		util.py

License

rmodi6/pacman-ai-search

Folders and files

Latest commit

History

Repository files navigation

pacman-ai-search

About

Topics

Resources

License

Stars

Watchers

Forks

Languages