{"repository":{"description":"This was the second project for Berkeley's CS188.1x. Essentially we were learning how to do minimax and expectimax searches against different types of adversaries.","watchers":0,"stargazers":0,"forks":3,"fork":false,"size":212,"owner":"kevjames3","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2012-11-07T23:49:38-08:00","pushed_at":"2012-11-07T23:53:00-08:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/andreaowu/CS188.1x-Project2"}