CS 440: Introduction to Artificial Intelligence, 2025 Fall

Course overview

Tentative schedule (subject to change)

Week Date Topic Book chapter Other information
1 9-1      

9-3

Introduction to the course

Chapter 1, 2 Link to lecture notes and slides
2

9-8

Project 0 due by midnight

Uninformed Search (BFS, DFS, Greedy)

3.4-3.4.3; 3.4.5  

9-10

Informed Search (A*)

3.4.4; 3.4.6; 3.4.7; 3.5-3.5.2; 3.6  
3 9-15

Informed Search (A*)

3.4.4; 3.4.6; 3.4.7; 3.5-3.5.2; 3.6  

9-17

Alpha-beta pruning, Expectimax search

5  
4

9-22

Project 1 due by midnight

Alpha-beta pruning, Expectimax search

5  

9-24

Constraint Satisfaction Problems

6  
5

9-29

Project 2 due by midnight

Probability, conditional independence

14.1-14.3  

10-1

Exam 1 Review

   
6

10-6

In-class Exam 1

   

10-8

Bayesian network 1: definition, conditional independence

14.1-14.3  
7

10-13

Bayesian network 2: inference, variable elimination 14.4-14.5  

10-15

Utility

16.1-16.3

 
8

10-20

Written HW1 due by midnight

Markov Decision Processes (MDPs) 21  

10-22

Reinforcement learning

1  
9

10-27

Reinforcement learning 15.2, 15.5  

10-29

Written HW2 due by midnight

Probabilistic Reasoning over Time

15.2, 15.5  
10
11-3

Hidden Markov Models: Filtering Algorithm

15.2, 15.5, 15.6  

11-5

Project 3 due by midnight

Exam 2 Review    
11

11-10

In-class Exam 2    

11-12

Hidden Markov Models: Particle Filters

   
12

11-17

Speech

Hidden Markov Models: Viterbi Algorithm

   

11-19

Project 4 due by midnight

Naive Bayes

   
13

11-24

Perceptrons

   

11-26 no class (Friday schedule)

     
14

12-1

MIRA, SVM, and k-NN    
12-3 Neural Networks    
15

12-8

Project 5 due by midnight

Advanced Topics

   

12-10

Final Exam (comprehensive) Review

   
16

12-15

In-class Exam 3 starting at 08:00PM    

 

 

     

 

Textbook for reference (not required)

Artificial Intelligence: A Modern Approach (third edition), Prentice Hall, 2009.

By Stuart Russell and Peter Norvig

Prerequisites

Objectives

General Class Policies

Grading

Regrading Policies

Project assignments and written homeworks

Academic dishonesty and late policy

Acknowledgements

Thanks Pieter Abbeel, Vincent Conitzer, John DeNero, Dan Klein, Malik Magdon-Ismai, Xintong Wang, Peter Sone for offering tremendous helps on developing the course!