KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #cli #open-source #ai #claude-code #codex #deepseek-harness #dsh-plugin #react #windows #developer-tools

UC-Berkeley-CS-188-Artificial-Intelligence

★ 86 Open GitHub ↗

Assignment code for UC Berkeley CS 188 Artificial Intelligence

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# UC Berkeley CS 188 Artificial Intelligence
Assignment code for UC Berkeley CS 188 Artificial Intelligence.

For open course material in edX, using this class: [BerkeleyX: CS188.1x
Artificial Intelligence](https://courses.edx.org/courses/BerkeleyX/CS188.1x-4/1T2015/course/)

## Projects
1. Project 0: Python Refresher
   * [addition.py](./Projects/Project0-PythonRefresher/addition.py)
   * [buyLotsOfFruit.py](./Projects/Project0-PythonRefresher/buyLotsOfFruit.py)
   * [shopSmart.py](./Projects/Project0-PythonRefresher/shopSmart.py)
2. Project 1: Search ([Python 3 Version](https://github.com/BigEggStudy/UW-CSEP-573-Wi19-Artificial-Intelligence/blob/master/Project%201%20-%20Search/))
   * [search.py](./Projects/Project1-Search/search.py)
   * [searchAgents.py](./Projects/Project1-Search/searchAgents.py)

## Quizzes
1. Lecture 2: Uninformed Search
   * [Quiz 1: Planning Agents vs. Reflex Agents](./Quizzes/Lecture02-UninformedSearch/Quiz01-PlanningAgentsVsReflexAgents.pdf)
   * [Quiz 2: Safe Passage](./Quizzes/Lecture02-UninformedSearch/Quiz02-SafePassage.pdf)
   * [Quiz 3: State Space Graphs and Search Trees](./Quizzes/Lecture02-UninformedSearch/Quiz03-StateSpaceGraphsAndSearchTrees.pdf)
   * [Quiz 4: Depth-First Tree Search](./Quizzes/Lecture02-UninformedSearch/Quiz04-DepthFirstTreeSearch.pdf)
   * [Quiz 5: Depth-First Tree Search: Space and Time Complexity](./Quizzes/Lecture02-UninformedSearch/Quiz05-DepthFirstTreeSearch-SpaceAndTimeComplexity.pdf)
   * [Quiz 6: Breadth-First Tree Search](./Quizzes/Lecture02-UninformedSearch/Quiz06-BreadthFirstTreeSearch.pdf)
   * [Quiz 7: Breadth-First Tree Search: Space and Time Complexity](./Quizzes/Lecture02-UninformedSearch/Quiz07-BreadthFirstTreeSearch-SpaceAndTimeComplexity.pdf)
   * [Quiz 9: Which Search Algorithm?](./Quizzes/Lecture02-UninformedSearch/Quiz09-WhichSearchAlgorithm.pdf)
   * [Quiz 10: Which Search Algorithm?](./Quizzes/Lecture02-UninformedSearch/Quiz10-WhichSearchAlgorithm.pdf)
   * [Quiz 11: Uniform Cost Search](./Quizzes/Lecture02-UninformedSearch/Quiz11-UniformCostSearch.pdf)
   * [Quiz 12: Which Search Algorithm?](./Quizzes/Lecture02-UninformedSearch/Quiz12-WhichSearchAlgorithm.pdf)
   * [Quiz 13: Which Search Algorithm?](./Quizzes/Lecture02-UninformedSearch/Quiz13-WhichSearchAlgorithm.pdf)
2. Lecture 3: Informed Search
   * [Quiz 1: Search Execution](./Quizzes/Lecture03-InformedSearch/Quiz01-SearchExecution.pdf)
   * [Quiz 2: Greedy Search](./Quizzes/Lecture03-InformedSearch/Quiz02-GreedySearch.pdf)
   * [Quiz 3: A* Tree Search](./Quizzes/Lecture03-InformedSearch/Quiz03-AStarTreeSearch.pdf)
   * [Quiz 4: A* Tree Search](./Quizzes/Lecture03-InformedSearch/Quiz04-AStarTreeSearch.pdf)
   * [Quiz 5: Which Search Algorithm?](./Quizzes/Lecture03-InformedSearch/Quiz05-WhichSearchAlgorithm.pdf)
   * [Quiz 6: Which Search Algorithm?](./Quizzes/Lecture03-InformedSearch/Quiz06-WhichSearchAlgorithm.pdf)
   * [Quiz 7: Which Search Algorithm?](./Quizzes/Lecture03-InformedSearch/Quiz07-WhichSearchAlgorithm.pdf)
   * [Quiz 8: Which Search Algorithm?](./Quizzes/Lecture03-InformedSearch/Quiz08-WhichSearchAlgorithm.pdf)
   * [Quiz 9: Which Search Algorithm?](./Quizzes/Lecture03-InformedSearch/Quiz09-WhichSearchAlgorithm.pdf)
   * [Quiz 10: Admissible Heuristics](./Quizzes/Lecture03-InformedSearch/Quiz10-AdmissibleHeuristics.pdf)
   * [Quiz 11: Combining Heuristics](./Quizzes/Lecture03-InformedSearch/Quiz11-CombiningHeuristics.pdf)
   * [Quiz 12: Consistency](./Quizzes/Lecture03-InformedSearch/Quiz12-Consistency.pdf)
3. Lecture 4: CSPs
   * [Quiz 1: Constraints](./Quizzes/Lecture04-CSPs/Quiz01-Constraints.pdf)
   * [Quiz 2: Constraint Graphs](./Quizzes/Lecture04-CSPs/Quiz02-ConstraintGraphs.pdf)
   * [Quiz 3: Constraints](./Quizzes/Lecture04-CSPs/Quiz03-Constraints.pdf)
   * [Quiz 4: Backtracking Search](./Quizzes/Lecture04-CSPs/Quiz04-BacktrackingSearch.pdf)
   * [Quiz 5: Forward Checking](./Quizzes/Lecture04-CSPs/Quiz05-ForwardChecking.pdf)
   * [Quiz 6: Arc Consistency](./Quizzes/Lecture04-CSPs/Quiz06-ArcConsistency.pdf)
   * [Quiz 7: Arc Consistency](./Quizzes/Lecture04-CSPs/Quiz07-ArcConsistency.pdf)
   * [Quiz 8: Least Constraining Value](./Quizzes/Lecture04-CSPs/Quiz08-LeastConstrainingValue.pdf)
4. Lecture 5: CSPs II
   * [Quiz 1: Tree-Structured CSPs](./Quizzes/Lecture05-CSPsII/Quiz01-TreeStructuredCSPs.pdf)
   * [Quiz 2: Smallest Cutset](./Quizzes/Lecture05-CSPsII/Quiz02-SmallestCutset.pdf)
   * [Quiz 3: Min-Conflicts](./Quizzes/Lecture05-CSPsII/Quiz03-MinConflicts.pdf)
   * [Quiz 4: Hill Climbing](./Quizzes/Lecture05-CSPsII/Quiz04-HillClimbing.pdf)
5. Lecture 6: Adversarial Search
   * [Quiz 1: Minimax](./Quizzes/Lecture06-AdversarialSearch/Quiz01-Minimax.pdf)
   * [Quiz 2: Evaluation and Collaboration](./Quizzes/Lecture06-AdversarialSearch/Quiz02-EvaluationAndCollaboration.pdf)
   * [Quiz 3: Alpha-Beta Pruning](./Quizzes/Lecture06-AdversarialSearch/Quiz03-AlphaBetaPruning.pdf)
6. Lecture 7: Uncertainty and Utilities
   * [Quiz 1: Expectimax](./Quizzes/Lecture07-UncertaintyAndUtilities/Quiz01-Expectimax.pdf)
   * [Quiz 3: Other Games](./Quizzes/Lecture07-UncertaintyAndUtilities/Quiz03-OtherGames.pdf)
   * [Quiz 4: Monotonic Transformations](./Quizzes/Lecture07-UncertaintyAndUtilities/Quiz04-MonotonicTransformations.pdf)
   * [Quiz 5: Rationality](./Quizzes/Lecture07-UncertaintyAndUtilities/Quiz05-Rationality.pdf)
   * [Quiz 6: Certainty Equivalent Values](./Quizzes/Lecture07-UncertaintyAndUtilities/Quiz06-CertaintyEquivalentValues.pdf)
7. Lecture 8: Markov Decision Processes
   * [Quiz 1: MDP Notation](./Quizzes/Lecture08-MarkovDecisionProcesses/Quiz01-MDPNotation.pdf)
   * [Quiz 2: Discounting](./Quizzes/Lecture08-MarkovDecisionProcesses/Quiz02-Discounting.pdf)
   * [Quiz 3: Solving MDPs](./Quizzes/Lecture08-MarkovDecisionProcesses/Quiz03-SolvingMDPs.pdf)
   * [Quiz 4: Value Iteration](./Quizzes/Lecture08-MarkovDecisionProcesses/Quiz04-ValueIteration.pdf)
8. Lecture 9: Markov Decision Processes II
   * [Quiz 1: The Bellman Equation](./Quizzes/Lecture09-MarkovDecisionProcessesII/Quiz01-TheBellmanEquation.pdf)
   * [Quiz 2: Policy Evaluation](./Quizzes/Lecture09-MarkovDecisionProcessesII/Quiz02-PolicyEvaluation.pdf)
   * [Quiz 3: Policy Iteration](./Quizzes/Lecture09-MarkovDecisionProcessesII/Quiz03-PolicyIteration.pdf)
9. Lecture 10: Reinforcement Learning
   * [Quiz 1: Reinforcement Learning](./Quizzes/Lecture10-ReinforcementLearning/Quiz01-ReinforcementLearning.pdf)
   * [Quiz 2: Model-Based Learning](./Quizzes/Lecture10-ReinforcementLearning/Quiz02-ModelBasedLearning.pdf)
   * [Quiz 3: Passive Reinforcement Learning](./Quizzes/Lecture10-ReinforcementLearning/Quiz03-PassiveReinforcementLearning.pdf)
   * [Quiz 4: TD Learning](./Quizzes/Lecture10-ReinforcementLearning/Quiz04-TDLearning.pdf)
   * [Quiz 5: Q-Learning](./Quizzes/Lecture10-ReinforcementLearning/Quiz05-QLearning.pdf)
0. Lecture 11: Reinforcement Learning II
   * [Quiz 1: Exploration vs. Exploitation](./Quizzes/Lecture11-ReinforcementLearningII/Quiz01-ExplorationVsExploitation.pdf)
   * [Quiz 2: Feature-Based Representations](./Quizzes/Lecture11-ReinforcementLearningII/Quiz02-FeatureBasedRepresentations.pdf)

# Homeworks
1. Homework 1 - Search
   * [Question 1: Search Trees](./Homeworks/Homework01-Search/Question01-SearchTrees.pdf)
   * [Question 2: Depth-First Graph Search](./Homeworks/Homework01-Search/Question02-DepthFirstGraphSearch.pdf)
   * [Question 3: Breadth-First Graph Search](./Homeworks/Homework01-Search/Question03-BreadthFirstGraphSearch.pdf)
   * [Question 4: A* Graph Search](./Homeworks/Homework01-Search/Question04-AStarGraphSearch.pdf)
   * [Question 5: Hive Minds: Lonely Bug](./Homeworks/Homework01-Search/Question05-HiveMinds-LonelyBug.pdf)
   * [Question 6: Hive Minds: Swarm Movement](./Homeworks/Homework01-Search/Question06-HiveMinds-SwarmMovement.pdf)
   * [Question 7: Hive Minds: Migrating Birds](./Homeworks/Homework01-Search/Question07-HiveMinds-MigratingBirds.pdf)
   * [Question 8: Hive Minds: Jumping Bug](./Homeworks/Homework01-Search/Question08-HiveMinds-JumpingBug.pdf)
   * [Question 9: Hive Minds: Lost at Night](./Homeworks/Homework01-Search/Question09-HiveMinds-LostAtNight.pdf)
   * [Question 10: Early Goal Checking Graph Search](./Homeworks/Homework01-Search/Question10-EarlyGoalCheckingGraphSearch.pdf)
   * [Question 11: Lookahead Graph Search](./Homeworks/Homework01-Search/Question11-LookaheadGraphSearch.pdf)
   * [Question 12: Memory Efficient Graph Search](./Homeworks/Homework01-Search/Question12-MemoryEfficientGraphSearch.pdf)
   * [Question 13: A*-CSCS](./Homeworks/Homework01-Search/Question13-AStarCSCS.pdf)
2. Homework 1 - Search (Practice)
   * [Question 1: Search Trees](./Homeworks/Homework01-Search(Practice)/Question01-SearchTrees.pdf)
   * [Question 2: Depth-First Graph Search](./Homeworks/Homework01-Search(Practice)/Question02-DepthFirstGraphSearch.pdf)
   * [Question 3: Breadth-First Graph Search](./Homeworks/Homework01-Search(Practice)/Question03-BreadthFirstGraphSearch.pdf)
   * [Question 4: A* Graph Search](./Homeworks/Homework01-Search(Practice)/Question04-AStarGraphSearch.pdf)
   * [Question 5: Hive Minds: Lonely Bug](./Homeworks/Homework01-Search(Practice)/Question05-HiveMinds-LonelyBug.pdf)
   * [Question 6: Hive Minds: Swarm Movement](./Homeworks/Homework01-Search(Practice)/Question06-HiveMinds-SwarmMovement.pdf)
   * [Question 7: Hive Minds: Migrating Birds](./Homeworks/Homework01-Search(Practice)/Question07-HiveMinds-MigratingBirds.pdf)
   * [Question 8: Hive Minds: Jumping Bug](./Homeworks/Homework01-Search(Practice)/Question08-HiveMinds-JumpingBug.pdf)
   * [Question 9: Hive Minds: Lost at Night](./Homeworks/Homework01-Search(Practice)/Question09-HiveMinds-LostAtNight.pdf)
   * [Question 10: Early Goal Checking Graph Search](./Homeworks/Homework01-Search(Practice)/Question10-EarlyGoalCheckingGraphSearch.pdf)
   * [Question 11: Lookahead Graph Search](./Homeworks/Homework01-Search(Practice)/Question11-LookaheadGraphSearch.pdf)
   * [Question 12: Memory Efficient Graph Search](./Homeworks/Homework01-Search(Practice)/Question12-MemoryEfficientGraphSearch.pdf)
   * [Question 13: A*-CSCS](./Homeworks/Homework01-Search(Practice)/Question13-AStarCSCS.pdf)
3. Homework 2 - CSPs
   * [Question 1: Campus Layout](./Homeworks/Homework02-CSPs/Question01-CampusLayout.pdf)
   * [Question 2: CSP Properties](./Homeworks/Homework02-CSPs/Question02-CSPProperties.pdf)
   * [Question 3: 4-Queens](./Homeworks/Homework02-CSPs/Question03-4Queens.pdf)
   * [Question 4: Tree-Structured CSPs](./Homeworks/Homework02-CSPs/Question04-TreeStructuredCSPs.pdf)
   * [Question 5: Solving Tree-Structured CSPs](./Homeworks/Homework02-CSPs/Question05-SolvingTreeStructuredCSPs.pdf)
   * [Question 6: Arc Consistency](./Homeworks/Homework02-CSPs/Question06-ArcConsistency.pdf)
   * [Question 7: Arc Consistency Properties](./Homeworks/Homework02-CSPs/Question07-ArcConsistencyProperties.pdf)
   * [Question 8: Backtracking Arc Consistency](./Homeworks/Homework02-CSPs/Question08-BacktrackingArcConsistency.pdf)
4. Homework 2 - CSPs (Practice)
   * [Question 1: Campus Layout](./Homeworks/Homework02-CSPs(Practice)/Question01-CampusLayout.pdf)
   * [Question 2: CSP Properties](./Homeworks/Homework02-CSPs(Practice)/Question02-CSPProperties.pdf)
   * [Question 3: 4-Queens](./Homeworks/Homework02-CSPs(Practice)/Question03-4Queens.pdf)
   * [Question 4: Tree-Structured CSPs](./Homeworks/Homework02-CSPs(Practice)/Question04-TreeStructuredCSPs.pdf)
   * [Question 5: Solving Tree-Structured CSPs](./Homeworks/Homework02-CSPs(Practice)/Question05-SolvingTreeStructuredCSPs.pdf)
   * [Question 6: Arc Consistency](./Homeworks/Homework02-CSPs(Practice)/Question06-ArcConsistency.pdf)
   * [Question 7: Arc Consistency Properties](./Homeworks/Homework02-CSPs(Practice)/Question07-ArcConsistencyProperties.pdf)
   * [Question 8: Backtracking Arc Consistency](./Homeworks/Homework02-CSPs(Practice)/Question08-BacktrackingArcConsistency.pdf)
5. Homework 3 - Games
   * [Question 1: Minimax](./Homeworks/Homework03-Games/Question01-Minimax.pdf)
   * [Question 2: Expectiminimax](./Homeworks/Homework03-Games/Question02-Expectiminimax.pdf)
   * [Question 3: Unknown Leaf Value](./Homeworks/Homework03-Games/Question03-UnknownLeafValue.pdf)
   * [Question 4: Alpha-Beta Pruning](./Homeworks/Homework03-Games/Question04-AlphaBetaPruning.pdf)
   * [Question 5.1: Non-Zero-Sum Games](./Homeworks/Homework03-Games/Question05-NonZeroSumGames.pdf)
   * [Question 5.2: Properties of Non-Zero-Sum Games](./Homeworks/Homework03-Games/Question05-PropertiesOfNonZeroSumGames.pdf)
   * [Question 6: Possible Pruning](./Homeworks/Homework03-Games/Question06-PossiblePruning.pdf)
   * [Question 7: Suboptimal Strategies](./Homeworks/Homework03-Games/Question07-SuboptimalStrategies.pdf)
   * [Question 8: Shallow Search](./Homeworks/Homework03-Games/Question08-ShallowSearch.pdf)
   * [Question 9: Rationality of Utilities](./Homeworks/Homework03-Games/Question09-RationalityOfUtilities.pdf)
   * [Question 10: Certainty Equivalent Values](./Homeworks/Homework03-Games/Question10-CertaintyEquivalentValues.pdf)
   * [Question 11: Preferences and Utilities](./Homeworks/Homework03-Games/Question11-PreferencesAndUtilities.pdf)
6. Homework 3 - Games (Practice)
   * [Question 1: Minimax](./Homeworks/Homework03-Games(Practice)/Question01-Minimax.pdf)
   * [Question 2: Expectiminimax](./Homeworks/Homework03-Games(Practice)/Question02-Expectiminimax.pdf)
   * [Question 3: Unknown Leaf Value](./Homeworks/Homework03-Games(Practice)/Question03-UnknownLeafValue.pdf)
   * [Question 4: Alpha-Beta Pruning](./Homeworks/Homework03-Games(Practice)/Question04-AlphaBetaPruning.pdf)
   * [Question 5.1: Non-Zero-Sum Games](./Homeworks/Homework03-Games(Practice)/Question05-NonZeroSumGames.pdf)
   * [Question 5.2: Properties of Non-Zero-Sum Games](./Homeworks/Homework03-Games(Practice)/Question05-PropertiesOfNonZeroSumGames.pdf)
   * [Question 6: Possible Pruning](./Homeworks/Homework03-Games(Practice)/Question06-PossiblePruning.pdf)
   * [Question 7: Suboptimal Strategies](./Homeworks/Homework03-Games(Practice)/Question07-SuboptimalStrategies.pdf)
   * [Question 8: Shallow Search](./Homeworks/Homework03-Games(Practice)/Question08-ShallowSearch.pdf)
   * [Question 9: Rationality of Utilities](./Homeworks/Homework03-Games(Practice)/Question09-RationalityOfUtilities.pdf)
   * [Question 10: Certainty Equivalent Values](./Homeworks/Homework03-Games(Practice)/Question10-CertaintyEquivalentValues.pdf)
   * [Question 11: Preferences and Utilities](./Homeworks/Homework03-Games(Practice)/Question11-PreferencesAndUtilities.pdf)
7. Homework 4 - MDPs
   * [Question 1: Solving MDPs](./Homeworks/Homework04-MDPs/Question01-SolvingMDPs.pdf)
   * [Question 2: Value Iteration Convergence Values](./Homeworks/Homework04-MDPs/Question02-ValueIterationConvergenceValues.pdf)
   * [Question 3: Value Iteration: Cycle](./Homeworks/Homework04-MDPs/Question03-ValueIteration-Cycle.pdf)
   * [Question 4: Value Iteration: Properties](./Homeworks/Homework04-MDPs/Question04-ValueIteration-Properties.pdf)
   * [Question 5: Value Iteration: Convergence](./Homeworks/Homework04-MDPs/Question05-ValueIteration-Convergence.pdf)
   * [Question 6: Policy Evaluation](./Homeworks/Homework04-MDPs/Question06-PolicyEvaluation.pdf)
   * [Question 7: Policy Iteration](./Homeworks/Homework04-MDPs/Question07-PolicyIteration.pdf)
   * [Question 8: Policy Iteration: Cycle](./Homeworks/Homework04-MDPs/Question08-PolicyIteration-Cycle.pdf)
   * [Question 9: Wrong Discount Factor](./Homeworks/Homework04-MDPs/Question09-WrongDiscountFactor.pdf)
   * [Question 10: MDP Properties](./Homeworks/Homework04-MDPs/Question10-MDPProperties.pdf)
   * [Question 11: Policies](./Homeworks/Homework04-MDPs/Question11-Policies.pdf)
8. Homework 4 - MDPs (Practice)
   * [Question 1: Solving MDPs](./Homeworks/Homework04-MDPs(Practice)/Question01-SolvingMDPs.pdf)
   * [Question 2: Value Iteration Convergence Values](./Homeworks/Homework04-MDPs(Practice)/Question02-ValueIterationConvergenceValues.pdf)
   * [Question 3: Value Iteration: Cycle](./Homeworks/Homework04-MDPs(Practice)/Question03-ValueIteration-Cycle.pdf)
   * [Question 4: Value Iteration: Properties](./Homeworks/Homework04-MDPs(Practice)/Question04-ValueIteration-Properties.pdf)
   * [Question 5: Value Iteration: Convergence](./Homeworks/Homework04-MDPs(Practice)/Question05-ValueIteration-Convergence.pdf)
   * [Question 6: Policy Evaluation](./Homeworks/Homework04-MDPs(Practice)/Question06-PolicyEvaluation.pdf)
   * [Question 7: Policy Iteration](./Homeworks/Homework04-MDPs(Practice)/Question07-PolicyIteration.pdf)
   * [Question 8: Policy Iteration: Cycle](./Homeworks/Homework04-MDPs(Practice)/Question08-PolicyIteration-Cycle.pdf)
   * [Question 9: Wrong Discount Factor](./Homeworks/Homework04-MDPs(Practice)/Question09-WrongDiscountFactor.pdf)
   * [Question 10: MDP Properties](./Homeworks/Homework04-MDPs(Practice)/Question10-MDPProperties.pdf)
   * [Question 11: Policies](./Homeworks/Homework04-MDPs(Practice)/Question11-Policies.pdf)
9. Homework 5 - Reinforcement Learning
   * [Question 1: Model-Based RL: Grid](./Homeworks/Homework05-ReinforcementLearning/Question01-ModelBasedRL-Grid.pdf)
   * [Question 2: Model-Based RL: Cycle](./Homeworks/Homework05-ReinforcementLearning/Question02-ModelBasedRL-Cycle.pdf)
   * [Question 3: Direct Evaluation](./Homeworks/Homework05-ReinforcementLearning/Question03-DirectEvaluation.pdf)
   * [Question 4: Temporal Difference Learning](./Homeworks/Homework05-ReinforcementLearning/Question04-TemporalDifferenceLearning.pdf)
   * [Question 5: Model-Free RL: Cycle](./Homeworks/Homework05-ReinforcementLearning/Question05-ModelFreeRL-Cycle.pdf)
   * [Question 6: Q-Learning Properties](./Homeworks/Homework05-ReinforcementLearning/Question06-QLearningProperties.pdf)
   * [Question 7: Exploration and Exploitation](./Homeworks/Homework05-ReinforcementLearning/Question07-ExplorationAndExploitation.pdf)
   * [Question 8: Feature-Based Representation: Actions](./Homeworks/Homework05-ReinforcementLearning/Question08-FeatureBasedRepresentation-Actions.pdf)
   * [Question 9: Feature-Based Representation: Update](./Homeworks/Homework05-ReinforcementLearning/Question09-FeatureBasedRepresentation-Update.pdf)
0. Homework 5 - Reinforcement Learning (Practice)
   * [Question 1: Model-Based RL: Grid](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question01-ModelBasedRL-Grid.pdf)
   * [Question 2: Model-Based RL: Cycle](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question02-ModelBasedRL-Cycle.pdf)
   * [Question 3: Direct Evaluation](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question03-DirectEvaluation.pdf)
   * [Question 4: Temporal Difference Learning](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question04-TemporalDifferenceLearning.pdf)
   * [Question 5: Model-Free RL: Cycle](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question05-ModelFreeRL-Cycle.pdf)
   * [Question 6: Q-Learning Properties](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question06-QLearningProperties.pdf)
   * [Question 7: Exploration and Exploitation](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question07-ExplorationAndExploitation.pdf)
   * [Question 8: Feature-Based Representation: Actions](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question08-FeatureBasedRepresentation-Actions.pdf)
   * [Question 9: Feature-Based Representation: Update](./Homeworks/Homework05-ReinforcementLearning(Practice)/Question09-FeatureBasedRepresentation-Update.pdf)

# Midterm Exam
0. Practice I
   * [Question 1: Search](./MidtermExam/PracticeI/Question01-Search.pdf)
   * [Question 2: Hive Minds](./MidtermExam/PracticeI/Question02-HiveMinds.pdf)
   * [Question 3: CSPs: Time Management](./MidtermExam/PracticeI/Question03-CSPs-TimeManagement.pdf)
   * [Question 4: Surrealist Pacman](./MidtermExam/PracticeI/Question04-SurrealistPacman.pdf)
   * [Question 5: MDPs: Grid-World Water Park](./MidtermExam/PracticeI/Question05-MDPs-GridWorldWaterPark.pdf)
   * [Question 6: Short Answer: Search](./MidtermExam/PracticeI/Question06-ShortAnswer-Search.pdf)
   * [Question 7: Short Answer: Iterative Deepening](./MidtermExam/PracticeI/Question07-ShortAnswer-IterativeDeepening.pdf)
   * [Question 8: Short Answer: Dominance](./MidtermExam/PracticeI/Question08-ShortAnswer-Dominance.pdf)
   * [Question 9: Short Answer: Heuristics](./MidtermExam/PracticeI/Question09-ShortAnswer-Heuristics.pdf)
   * [Question 10: Short Answer: CSP](./MidtermExam/PracticeI/Question10-ShortAnswer-CSP.pdf)
   * [Question 11: Short Answer: Games](./MidtermExam/PracticeI/Question11-ShortAnswer-Games.pdf)
0. Practice I (Practice)
   * [Question 1: Search](./MidtermExam/PracticeI(Practice)/Question01-Search.pdf)
   * [Question 2: Hive Minds](./MidtermExam/PracticeI(Practice)/Question02-HiveMinds.pdf)
   * [Question 3: CSPs: Time Management](./MidtermExam/PracticeI(Practice)/Question03-CSPs-TimeManagement.pdf)
   * [Question 4: Surrealist Pacman](./MidtermExam/PracticeI(Practice)/Question04-SurrealistPacman.pdf)
   * [Question 5: MDPs: Grid-World Water Park](./MidtermExam/PracticeI(Practice)/Question05-MDPs-GridWorldWaterPark.pdf)
   * [Question 6: Short Answer: Search](./MidtermExam/PracticeI(Practice)/Question06-ShortAnswer-Search.pdf)
   * [Question 7: Short Answer: Iterative Deepening](./MidtermExam/PracticeI(Practice)/Question07-ShortAnswer-IterativeDeepening.pdf)
   * [Question 8: Short Answer: Dominance](./MidtermExam/PracticeI(Practice)/Question08-ShortAnswer-Dominance.pdf)
   * [Question 9: Short Answer: Heuristics](./MidtermExam/PracticeI(Practice)/Question09-ShortAnswer-Heuristics.pdf)
   * [Question 10: Short Answer: CSP](./MidtermExam/PracticeI(Practice)/Question10-ShortAnswer-CSP.pdf)
   * [Question 11: Short Answer: Games](./MidtermExam/PracticeI(Practice)/Question11-ShortAnswer-Games.pdf)
0. Practice II
   * [Question 1: Search](./MidtermExam/PracticeII/Question01-Search.pdf)
   * [Question 2: Search: Heuristic Function Properties](./MidtermExam/PracticeII/Question02-Search-HeuristicFunctionProperties.pdf)
   * [Question 3: Search: Slugs](./MidtermExam/PracticeII/Question03-Search-Slugs.pdf)
   * [Question 4: Value Functions](./MidtermExam/PracticeII/Question04-ValueFunctions.pdf)
   * [Question 5: CSPs: CS188x Offices](./MidtermExam/PracticeII/Question05-CSPs-CS188xOffices.pdf)
   * [Question 6: CSP Properties](./MidtermExam/PracticeII/Question06-CSPProperties.pdf)
   * [Question 7: Games: Alpha-Beta Pruning](./MidtermExam/PracticeII/Question07-Games-AlphaBetaPruning.pdf)
   * [Question 8: Utilities: Low/High](./MidtermExam/PracticeII/Question08-Utilities-LowHigh.pdf)
   * [Question 9: MDPs and Reinforcement Learning: Mini-Grids](./MidtermExam/PracticeII/Question09-MDPsAndReinforcementLearning-MiniGrids.pdf)
0. Practice II (Practice)
   * [Question 1: Search](./MidtermExam/PracticeII(Practice)/Question01-Search.pdf)
   * [Question 2: Search: Heuristic Function Properties](./MidtermExam/PracticeII(Practice)/Question02-Search-HeuristicFunctionProperties.pdf)
   * [Question 3: Search: Slugs](./MidtermExam/PracticeII(Practice)/Question03-Search-Slugs.pdf)
   * [Question 4: Value Functions](./MidtermExam/PracticeII(Practice)/Question04-ValueFunctions.pdf)
   * [Question 5: CSPs: CS188x Offices](./MidtermExam/PracticeII(Practice)/Question05-CSPs-CS188xOffices.pdf)
   * [Question 6: CSP Properties](./MidtermExam/PracticeII(Practice)/Question06-CSPProperties.pdf)
   * [Question 7: Games: Alpha-Beta Pruning](./MidtermExam/PracticeII(Practice)/Question07-Games-AlphaBetaPruning.pdf)
   * [Question 8: Utilities: Low/High](./MidtermExam/PracticeII(Practice)/Question08-Utilities-LowHigh.pdf)
   * [Question 9: MDPs and Reinforcement Learning: Mini-Grids](./MidtermExam/PracticeII(Practice)/Question09-MDPsAndReinforcementLearning-MiniGrids.pdf)
0. Practice III
   * [Question 1: CSPs: Final Exam Staff Assignments](./MidtermExam/PracticeIII/Question01-CSPs-FinalExamStaffAssignments.pdf)
   * [Question 2: Solving Search Problems with MDPs](./MidtermExam/PracticeIII/Question02-SolvingSearchProblemsWithMDPs.pdf)
   * [Question 3: X-Values](./MidtermExam/PracticeIII/Question03-XValues.pdf)
   * [Question 4: Games with Magic](./MidtermExam/PracticeIII/Question04-GamesWithMagic.pdf)
   * [Question 5: Pruning and Child Expansion Ordering](./MidtermExam/PracticeIII/Question05-PruningAndChildExpansionOrdering.pdf)
   * [Question 6: A* Search: Batch Node Expansion](./MidtermExam/PracticeIII/Question06-AStarSearch-BatchNodeExpansion.pdf)
0. Practice III (Practice)
   * [Question 1: CSPs: Final Exam Staff Assignments](./MidtermExam/PracticeIII(Practice)/Question01-CSPs-FinalExamStaffAssignments.pdf)
   * [Question 2: Solving Search Problems with MDPs](./MidtermExam/PracticeIII(Practice)/Question02-SolvingSearchProblemsWithMDPs.pdf)
   * [Question 3: X-Values](./MidtermExam/PracticeIII(Practice)/Question03-XValues.pdf)
   * [Question 4: Games with Magic](./MidtermExam/PracticeIII(Practice)/Question04-GamesWithMagic.pdf)
   * [Question 5: Pruning and Child Expansion Ordering](./MidtermExam/PracticeIII(Practice)/Question05-PruningAndChildExpansionOrdering.pdf)
   * [Question 6: A* Search: Batch Node Expansion](./MidtermExam/PracticeIII(Practice)/Question06-AStarSearch-BatchNodeExpansion.pdf)
0. Exam
   * [Question 1: Pacman's Tour of San Francisco](./MidtermExam/Exam/Question01-PacmansTourOfSanFrancisco.pdf)
   * [Question 2: Missing Heuristic Values](./MidtermExam/Exam/Question02-MissingHeuristicValues.pdf)
   * [Question 3: PAC-CORP Assignments](./MidtermExam/Exam/Question03-PACCORPAssignments.pdf)
   * [Question 4: k-CSPs](./MidtermExam/Exam/Question04-kCSPs.pdf)
   * [Question 5: One Wish Pacman](./MidtermExam/Exam/Question05-OneWishPacman.pdf)
   * [Question 6: AlphaBetaExpinimax](./MidtermExam/Exam/Question06-AlphaBetaExpinimax.pdf)
   * [Question 7: Lotteries in Ghost Kingdom](./MidtermExam/Exam/Question07-LotteriesInGhostKingdom.pdf)
   * [Question 8: Indecisive Pacman](./MidtermExam/Exam/Question08-IndecisivePacman.pdf)
   * [Question 9: Reinforcement Learning](./MidtermExam/Exam/Question09-ReinforcementLearning.pdf)
   * [Question 10: Potpourri](./MidtermExam/Exam/Question010-Potpourri.pdf)

UC-Berkeley-CS-188-Artificial-Intelligence

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README