Differences

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

--- public:t-622-arti-14-1:main [2014/01/28 10:25] – [Course Schedule (subject to change)] stephan
+++ public:t-622-arti-14-1:main [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 13: / Line 13: @@
 ===== Book =====
-The textbook for this class is: //"Artificial Intelligence: A Modern Approach"// by Stuart Russell and Peter Norvig. This book has a [[http://aima.cs.berkeley.edu/|very good web site]] full of useful AI resources.
+The textbook for this class is: //"Artificial Intelligence: A Modern Approach"// by Stuart Russell and Peter Norvig. This book has a [[http://aima.cs.berkeley.edu/|good web site]] full of useful AI resources.
@@ Line 26: / Line 26: @@
 The [[public:t-622-arti-14-1:prog1|first programming assignment]] is to use search to find a good solution for a vacuum cleaning robot.
-/* The [[public:t-622-arti-13-1:prog2|second programming assignment]] is to program a Connect-4 agent. */
+The [[public:t-622-arti-14-1:prog2|second programming assignment]] is to program a Connect-4 agent.
@@ Line 57: / Line 57: @@
 |:::|Jan 23|      3|Blind Search, Heuristic Search         |
 |  3|Jan 28|      3|Heuristic Search     |
-|:::|Jan 29|    Lab|Lab 2 - Formulating Search Problem   |
+|:::|Jan 29|    Lab|[[Lab 2 - Hashing States]]   |
 |:::|Jan 30|      5|Adversarial Search (Minimax, Alpha-Beta)  |
-|  4|Feb 04|      5|Adversarial Search (Minimax, Alpha-Beta)  |
+|  4|Feb 04|      5,6|Adversarial Search (Algorithms), CSPs  |
-|:::|Feb 05|    Lab|Lab 3 - Hashing States       |
+|:::|Feb 05|    Lab|[[public:t-622-arti-14-1:prog2|Programming Assignment 2 - Connect 4]]       |
-|:::|Feb 06|      5|Adversarial Search (Algorithms)         |
+|:::|Feb 06|      6|CSPs         |
-|  5|Feb 11|       |Monte-Carlo Search, General Game Playing  |
+|  5|Feb 11|      7|Propositional Logic         |
-|:::|Feb 12|    Lab|Programming Assignment 2    |
+|:::|Feb 12|    Lab|[[Lab 3 - CSPs]]    |
-|:::|Feb 13|      7|Propositional Logic  |
+|:::|Feb 13|      7|Propositional Logic, Logical Agents  |
-|  6|Feb 18|      7|Propositional Logic, Logical Agents  |
+|  6|Feb 18|  7,8,9|Logical Agents, First Order Logic  |
-|:::|Feb 19|    Lab|Lab 4 - Propositional Logic     |
+|:::|Feb 19|    Lab|[[Lab 4 - Propositional Logic]]     |
-|:::|Feb 20|      7|Logical Agents  |
+|:::|Feb 20| 8,9,10|First Order Logic, Planning  |
-|  7|Feb 25|  7,8,9|Logical Agents, FOL  |
+|  7|Feb 25|     10|Planning |
-|:::|Feb 26|    Lab|time limits and caching with Alpha-Beta Search      |
+|:::|Feb 26|    Lab|Programming Assignment 2 - Competition      |
-|:::|Feb 27|    8,9|FOL  |
+|:::|Feb 27| 13, 14|Uncertainty, Bayesian Networks  |
-|  8|Mar 04|     10|Planning |
+|  8|Mar 04| 13, 14|Bayesian Networks |
-|:::|Mar 05|    Lab|Programming Assignment 2 - Competition         |
+|:::|Mar 05|    Lab|[[Lab 5 - Bayesian Networks]]         |
-|:::|Mar 06|     10|Planning      |
+|:::|Mar 06|  18-21|Machine Learning      |
-|  9|Mar 11|     13, 14|Uncertainty, Bayesian Networks  |
+|  9|Mar 11|   18.3|Learning Decision Trees  |
-|:::|Mar 12|    Lab|Lab 5 - Bayesian Networks  |
+|:::|Mar 12|    Lab|[[Lab 6 - Learning Decision Trees]]  |
-|:::|Mar 13|  14|Bayesian Networks  |
+|:::|Mar 13|     25|Robotics  |
-| 10|Mar 18|  18-21, 18.3|Machine Learning, Learning Decision Trees  |
+| 10|Mar 18|     15|Probabilistic Reasoning over Time  |
-|:::|Mar 19|    Lab|Lab 6 - Learning Decision Trees  |
+|:::|Mar 19|    Lab|[[Lab 7 - Particle Filtering]]  |
-|:::|Mar 20|     25|Robotics  |
+|:::|Mar 20|     15|Probabilistic Reasoning over Time  |
-| 11|Mar 25|     15|Probabilistic Reasoning over Time  |
+| 11|Mar 25|       |???  |
-|:::|Mar 26|    Lab|[[Lab 7 - Particle Filtering]]  |
+|:::|Mar 26|    Lab|???  |
 |:::|Mar 27|       |Wrap-Up  |
 | 13|Apr 01|       |Project Presentations  |