Project 1

• Berkeley Pacman Project 1 (https://inst.eecs.berkeley.edu/~cs188/sp19/project1.html)
  • Q1: Depth First Search
  • Q2: Breadth First Search
  • Q3: Uniform Cost Search
  • Q4: A* Search
  • Q5: Corners Problem: Representation
  • Q6: Corners Problem: Heuristic
  • Q7: Eating All The Dots: Heuristic
  • Q8: Suboptimal Search
• Theoritical Exercises on Search Algorithms

Project 2

• Berkeley Pacman Project 2 (https://inst.eecs.berkeley.edu/~cs188/sp20/project2/)
  • Q1: Reflex Agent
  • Q2: Minimax
  • Q3: Alpha-Beta Pruning
  • Q4: Expectimax
  • Q5: Evaluation Function
• Exercises on Minimax Algorithm

Project 3

• Constraint Santisfaction Problem: The radio link frequency assignment problem (RLFA) (https://miat.inrae.fr/schiex/rlfap.shtml)
• Theoritical Exercises on Constraint Santisfaction Problems

Project 4

Exercises on:

• Propositional Logic
• First-order Logic