CS 3600
Introduction to Artificial Intelligence

Prof. Mark Riedl (riedl@cc.gatech.edu)
Office hours: MF: 4:00-5:00, CCB 253

Homeworks

0. Uninformed Search (problem | solution) and answer the question: "why do humans find this problem hard at first?"
1. Search (problem | solution) also verify A* on the Romania problem.
1.5. Rook jumping maze generation (more on rook jumping mazes). Design a solution for rook jumping maze generation using hill-climbing by formalizing state representation, initial state, heuristic. Determine what algorithm will work best and why.
2. Games (problem | solution)
2.5. CSPs (problem | solution)
2.75. CSPs. Describe the game of Set (rules of the game) as a CSP. Use Backtracking search to solve the daily puzzle. You may also try it out on the sample from class. Hint: define a language that compares Pattern(), Shape(), Color(), and Number() of cards.
2.9. Prop Logic. (problem and solution)
3. FOL (problem | solution)
4. FOL (problem | solution). See the FOL resolution example.
Probability and Bayes Nets (problem | solution)
Bayesian inference (problem and solution)
Markov Decision Process Models (problem | solution)
Decision Trees (problem | solution)