Differences

This shows you the differences between two versions of the page.

--- start [2020/08/26 13:50]
anderson [Announcements]
+++ start [2020/09/22 11:55]
anderson [September]
@@ Line 1: / Line 1: @@
-====== Schedule ======
+===== Schedule ======
 ===== Announcements =====
+Links to live MS Teams events:
+  * Lectures: [[https://teams.microsoft.com/l/meetup-join/19%3a323d2d59a8f64282b836e440b8cb32d9%40thread.tacv2/1598126257845?context=%7b%22Tid%22%3a%22afb58802-ff7a-4bb1-ab21-367ff2ecfc8b%22%2c%22Oid%22%3a%22bcd6d782-40c2-430e-8091-fd9ebd260de7%22%7d|Tuesdays/Thursdays, 2:00 - 3:15 PM]]
+  * Office hours: Apoorv [[https://teams.microsoft.com/l/meetup-join/19%3a323d2d59a8f64282b836e440b8cb32d9%40thread.tacv2/1598300599034?context=%7b%22Tid%22%3a%22afb58802-ff7a-4bb1-ab21-367ff2ecfc8b%22%2c%22Oid%22%3a%22bcd6d782-40c2-430e-8091-fd9ebd260de7%22%7d|Mondays, 2:00 - 4:00 PM]]
+  * Office hours: Chaitanya [[https://teams.microsoft.com/l/meetup-join/19%3a323d2d59a8f64282b836e440b8cb32d9%40thread.tacv2/1598301087268?|Fridays, 2:00 - 4:00 PM]]
+  * Office hours: Chuck [[https://teams.microsoft.com/l/meetup-join/19%3a323d2d59a8f64282b836e440b8cb32d9%40thread.tacv2/1598288070646?|Wednesdays, 9:00 - 10:00 AM]]
-Lecture and office hour videos are available from the Home page of our
+Recordings of lecture and office hour videos are available from the Home page of our
 [[https://colostate.instructure.com/courses/109411|Canvas site]].
@@ Line 24: / Line 30: @@
 |< 100% 18% 20% 22% 20% 20%  >|
 ^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^nderson/cs545/doku.php?id=schedule#september
-| Week 2:\\ Aug 31 - Sept 4    | Problem-solving search and how to measure performance.\\ Iterative deepening and other uninformed search methods.   |  <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/03 Problem-Solving Agents.ipynb|03 Problem-Solving Agents]]\\  [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/04 Measuring Search Performance.ipynb|04 Measuring Search Performance]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/05 Iterative Deepening and Other Uninformed Search Methods.ipynb|05 Iterative Deepening and Other Uninformed Search Methods]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/06 Python Implementation of Iterative Deepening.ipynb|06 Python Implementation of Iterative Deepening]]  -->   | Sections 3.1 - 3.4 of Russell and Norvig  |   |
+| Week 2:\\ Aug 31 - Sept 4    | Help with A1.\\ Problem-solving search and how to measure performance.\\ Iterative deepening and other uninformed search methods.   | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/03 Problem-Solving Agents.ipynb|03 Problem-Solving Agents]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/04 Measuring Search Performance.ipynb|04 Measuring Search Performance]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/05 Iterative Deepening and Other Uninformed Search Methods.ipynb|05 Iterative Deepening and Other Uninformed Search Methods]]   | Sections 3.1 - 3.4 of Russell and Norvig  |   |
-| Week 3:\\ Sept 7 - Sept 11  | Informed search. A* search. Python classes, sorting, numpy arrays.  |   | Rest of Chapter 3  |  <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A1 Uninformed Search.ipynb|A1 Uninformed Search]] due Friday, Sept. 7, 10:00 PM.  Submit your notebook in Canvas.\\ Here are [[http://www.cs.colostate.edu/~anderson/cs440/notebooks/goodones|good solutions from your classmates]]  --> |
+| Week 3:\\ Sept 7 - Sept 11  | Informed search. A* search. Python classes, sorting, numpy arrays.  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/06 Python Implementation of Iterative Deepening.ipynb|06 Python Implementation of Iterative Deepening]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/07 Informed Search.ipynb|07 Informed Search]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/08 Python Classes.ipynb|08 Python Classes]]   | Rest of Chapter 3  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A1.1 Uninformed Search.ipynb|A1.1 Uninformed Search]] due Tuesday, Sept. 8, 10:00 PM.  Submit your notebook in Canvas.  <!--\\ Here are [[http://www.cs.colostate.edu/~anderson/cs440/notebooks/goodones|good solutions from your classmates]]  --> |
-| Week 4:\\ Sept 14 - Sept 18   | A* optimality, admissible heuristics, effective branching factor.\\ Local search and optimization.  | <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/07 Informed Search.ipynb|07 Informed Search]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/08 Python Classes.ipynb|08 Python Classes]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/09 Heuristic Functions.ipynb|09 Heuristic Functions]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/10 Local Search.ipynb|10 Local Search]]  -->  | Chapter 4  |  <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A2 Iterative-Deepening Search.ipynb|A2 Iterative-Deepening Search]] due Friday, Sept. 14, 10:00 PM.  Submit your notebook in Canvas.\\ Here are [[http://www.cs.colostate.edu/~anderson/cs440/notebooks/goodones|good solutions from your classmates]]  -->  |
+| Week 4:\\ Sept 14 - Sept 18   | A* optimality, admissible heuristics  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/09 Heuristic Functions.ipynb|09 Heuristic Functions]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/10 Local Search.ipynb|10 Local Search]]   | Chapter 4  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A2.1 Iterative-Deepening Search.ipynb|A2.1 Iterative-Deepening Search]] due Tuesday, Sept. 15, 10:00 PM. <!-- \\ Here are [[http://www.cs.colostate.edu/~anderson/cs440/notebooks/goodones|good solutions from your classmates]]  -->  |
-| Week 5:\\ Sept 21 - Sept 25   | Adversarial search. Minimax. Alpha-beta pruning. Stochastic games.  | <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/11 Adversarial Search.ipynb|11 Adversarial Search]]  -->  | Chapter 5  |
+| Week 5:\\ Sept 21 - Sept 25   | Effective branching factor.\\ Local search and optimization. Adversarial search. Minimax. Alpha-beta pruning. Stochastic games.  | <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/11 Adversarial Search.ipynb|11 Adversarial Search]]  -->  | Chapter 5  |
 | Week 6:\\ Sept 28 - Oct 2   | Negamax, with pruning. Introduction to Reinforcement Learning.  | <!-- [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/12 Negamax.ipynb|12 Negamax]]\\ [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/13 Modern Game Playing.ipynb|13 Modern Game Playing]]\\  [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/14 Introduction to Reinforcement Learning.ipynb|14 Introduction to Reinforcement Learning]]   -->    | Chapter 21\\ [[http://incompleteideas.net/book/bookdraft2017nov5.pdf|Reinforcement Learning: An Introduction]]   |  <!--  [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A3 A*, IDS, and Effective Branching Factor.ipynb|A3 A*, IDS, and Effective Branching Factor]] due Wednesday, Sept. 26, 10:00 PM.  Submit your notebook in Canvas. -->   |

CS440: Introduction to Artificial Intelligence

User Tools

Site Tools

Differences

Page Tools