Differences

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

--- start [2017/09/25 08:08]
anderson [September]
+++ start [2017/10/10 10:47]
anderson
@@ Line 33: / Line 33: @@
 | Week 3:\\ Sept 4 - Sept 8  | Informed search. A* search. Python classes, sorting, numpy arrays.  | [[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 Uninformed Search.ipynb|A1 Uninformed Search]] due Tuesday, September 5th, at 10:00 PM.\\ Here are examples of good A1 notebooks: [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-a.ipynb|a]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-b.ipynb|b]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-c.ipynb|c]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-d.ipynb|d]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-e.ipynb|e]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-f.ipynb|f]], [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/goodones/A1-good-g.ipynb|g]]  |
 | Week 4:\\ Sept 11 - Sept 15   | A* optimality, admissible heuristics, effective branching factor.\\ Local search and optimization.  |[[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 Thursday, September 14th, at 10:00 PM.\\ [[http://www.cs.colostate.edu/~anderson/cs440/notebooks/A2answer.tar|A2answer.tar]]   |
-| Week 5:\\ Sept 18 - Sept 22   | Adversarial search. Minimax.   | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/11 Adversarial Search.ipynb|11 Adversarial Search]] | Chapter 5  |
+| Week 5:\\ Sept 18 - Sept 22   | 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 25 - Sept 29   | Alpha-beta pruning. Negamax, with pruning. Stochastic games. Expectimax. |  | Sections 5.5 - 5.6 | [[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 Friday, September 29th, at 10:00 PM.   |
+| Week 6:\\ Sept 25 - Sept 29   | Negamax, with pruning. | [[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/A3 A*, IDS, and Effective Branching Factor.ipynb|A3 A*, IDS, and Effective Branching Factor]] due Friday, September 29th, at 10:00 PM.   |
 ===== October =====
@@ Line 40: / Line 40: @@
 |< 100% 10% 20% 30% 20% 20%  >|
 ^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^
-| Week 7:\\ Oct 2 - Oct 6  | Negamax.  Recent research in game search.  | [[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]]  |
+| Week 7:\\ Oct 2 - Oct 6  | Introduction to Reinforcement Learning.  | [[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/sutton/book/the-book-2nd.html|Reinforcement Learning: An Introduction]]  |  |
-| Week 8:\\ Oct 9 - Oct 13  | Introduction to Reinforcement Learning.  |  | Chapter 21\\ [[http://incompleteideas.net/sutton/book/the-book-2nd.html|Reinforcement Learning: An Introduction]]  |  |
+| Week 8:\\ Oct 9 - Oct 13  | Reinforcement Learning for Two-Player Games  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/15 Reinforcement Learning for Two-Player Games.ipynb|15 Reinforcement Learning for Two-Player Games]]  |  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A4 Negamax with Alpha-Beta Pruning and Iterative Deepening.ipynb|A4 Negamax with Alpha-Beta Pruning and Iterative Deepening]] due Wednesday, October 11th, at 10:00 PM.  |
 | Week 9:\\ Oct 16 - Oct 20  |
-| Week 10:\\ Oct 23 - Oct 27  |
+| Week 10:\\ Oct 23 - Oct 27  |  |  |  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A5 Reinforcement Learning Solution to Towers of Hanoi.ipynb|A5 Reinforcement Learning Solution to Towers of Hanoi]] due Wednesday, October 25th, at 10:00 PM.  |
 ===== November =====

CS440: Introduction to Artificial Intelligence

User Tools

Site Tools

Differences

Page Tools