CS440: Introduction to Artificial Intelligence

User Tools

Site Tools

Trace:
start

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision 		Previous revision
Next revision Both sides next revision
start [2017/08/31 10:42]
anderson 		start [2017/09/07 09:08]
anderson [September]
Line 31: Line 31:
 |< 100% 10% 20% 30% 20% 20%  >| |< 100% 10% 20% 30% 20% 20%  >|
 ^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^ ^  Week      ^  Topic      ^  Material  ^  Reading          ^  Assignments  ^
-| Week 3:\\ Sept 4 - Sept 8  | 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 Tuesday, September 5th, at 10:00 PM. | +| 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]]\\  [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/09 Heuristic Functions.ipynb|09 Heuristic Functions]]   | 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. | 
-| Week 4:\\ Sept 11 - Sept 15   | A* optimality, admissible heuristics, effective branching factor.\\ Local search and optimization.  |  | Chapter 4  | [[http://nbviewer.ipython.org/url/www.cs.colostate.edu/~anderson/cs440/notebooks/A2 Iterative-Deepening Search.ipynb|A2 Iterative-Deepening Search]] due Tuesday, September 12th, at 10:00 PM.   |+| Week 4:\\ Sept 11 - Sept 15   | A* optimality, admissible heuristics, effective branching factor.\\ Local search and optimization.  |  | 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.   |
 | Week 5:\\ Sept 18 - Sept 22   | Adversarial search. Minimax. Alpha-beta pruning. Negamax, with pruning.  |  | Chapter 5  | | Week 5:\\ Sept 18 - Sept 22   | Adversarial search. Minimax. Alpha-beta pruning. Negamax, with pruning.  |  | Chapter 5  |
 | Week 6:\\ Sept 25 - Sept 29   | Stochastic games. Expectimax. |  | Sections 5.5 - 5.6 | | Week 6:\\ Sept 25 - Sept 29   | Stochastic games. Expectimax. |  | Sections 5.5 - 5.6 |
start.txt · Last modified: 2024/01/08 18:40 (external edit)

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
CC Attribution-Noncommercial-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki