Topic: Game Search (Minimax, Alpha-Beta Pruning, Expectimax)

The solutions to these pac-man search problems were completed by Will Curran, a student at Texas A&M University, taking CSCE 420, Artificial Intelligence, with Dr. Shell. This repository is public as a way to showcase the project to potential employers, not to be a resource for students taking this class.

Texas A&M University: CSCE 420, Dr. Shell
Other Acknowledgements: The Pacman AI projects were developed at UC Berkeley. The core projects and autograders were primarily created by John DeNero (denero@cs.berkeley.edu) and Dan Klein (klein@cs.berkeley.edu). Student side autograding was added by Brad Miller, Nick Hay, and Pieter Abbeel (pabbeel@cs.berkeley.edu). We thank them for their permission to use it as a part of this course.	
We would also like to thank Dr. Scott Niekum (sniekum@cs.utexas.edu) of University of Texas at Austin.

The assignment information may be found here:
http://robotics.cs.tamu.edu/dshell/cs420/asgn2/proj2.html