Everyone:

Materials¶

Constraint Satisfaction: Foundations of Computational Agents - Sections 4.1 through 4.6¶

Additional Resources:

• Harvard CS50 (Video)
• Stanford CS221 (Video)
• MIT 6.034 (Video)
• CSPs for Sudoku (Blog Post)
• Consistency in Networks of Relations (Mackworth) (Paper)
• Network Based Heuristics for Constraint Satisfaction Problems (Dechter and Pearl) (Paper)
• Increasing Tree Search Efficiency for Constraint Satisfaction Problems (Haralick and Elliot) (Paper)
• CMU 15-281 (Blog Post)

Adversarial Search: Minimax Algorithm and Alpha-Beta Pruning (Blog Post)¶

Additional Resources:

• Foundations of Computational Agents - Sections 14.2 and 14.3 (Reading)
• Harvard CS50 (Video)
• Stanford CS221 (Video)
• MIT 6.034 (Video)
• Adversarial Search (Blog Post)
• (1928) Zur Theorie der Gesellschaftsspiele (von Neumann) (Paper)
• (1950) Programming a Computer for Playing Chess (Shannon) (Paper)
• (1975) An Analysis of Alpha-Beta Pruning (Knuth and Moore) (Paper)
• Minimax Algorithm (Blog Post)
• Tic-Tac-Toe: Understanding the Minimax Algorithm (Blog Post)