Differences

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

--- public:t-622-arti-13-1:main [2013/02/05 14:40] – [Final Project (25%)] stephan
+++ public:t-622-arti-13-1:main [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 35: / Line 35: @@
 The [[public:t-622-arti-13-1:prog1|first programming assignment]] is to use search to find a good solution for a vacuum cleaning robot.
-/*The [[public:t-622-arti-12-1:prog2|second programming assignment]] is to program a connect-4 agent.
+The [[public:t-622-arti-13-1:prog2|second programming assignment]] is to program a Connect-4 agent.
-*/
-==== Final Project (25%) ====
+==== T-622-ARTI. Spring 2013 - Final Project (25%) ====
 You can choose a topic for the final programming project (discuss topics and find a group in the [[http://ruclasses.proboards.com/index.cgi?board=arti2013&action=display&thread=118|forum]]). Like the programming assignments, this can be done as a group project (up to 4 people).
 You have to hand in a 1-2 page description of the project goal and some ideas on how to achieve it approx. in week 8 (5% of the final grade) and a report and demonstration in week 12 (20% of the final grade).
+[[public:t-622-arti-13-1:final_project|List of chosen topics]]
-/*
+==== Exam (40%) ====
-Project topics:
+There will be a final exam (3h) with questions similar to the ones in the assignments.
-*/
 ===== Course Schedule (subject to change) =====
@@ Line 60: / Line 60: @@
 |:::|Feb 01|      3|Heuristic Search     |
 |  4|Feb 04|      5|Adversarial Search (Minimax, Alpha-Beta)  |
-|:::|Feb 07|    Lab|?       |
+|:::|Feb 07|    Lab|[[Lab 3 - Hashing States]]       |
 |:::|Feb 08|      5|Adversarial Search (Algorithms)         |
 |  5|Feb 11|       |Monte-Carlo Search, General Game Playing  |
-|:::|Feb 14|    Lab|Programming Assignment 2    |
+|:::|Feb 14|    Lab|[[public:t-622-arti-13-1:prog2|Programming Assignment 2]]    |
-|:::|Feb 15|       |?  |
+|:::|Feb 15|      7|Propositional Logic  |
-|  6|Feb 18|      7|Propositional Logic  |
+|  6|Feb 18|      7|Propositional Logic, Logical Agents  |
-|:::|Feb 21|    Lab|?     |
+|:::|Feb 21|    Lab|[[Lab 4 - Propositional Logic]]     |
 |:::|Feb 22|      7|Logical Agents  |
 |  7|Feb 25|  7,8,9|Logical Agents, FOL  |
-|:::|Feb 28|    Lab|Lab 3 - Logic       |
+|:::|Feb 28|    Lab|time limits and caching with Alpha-Beta Search      |
 |:::|Mar 01|    8,9|FOL  |
 |  8|Mar 04|     10|Planning |
-|:::|Mar 07|    Lab|Programming Assignment 2 - Results         |
+|:::|Mar 07|    Lab|[[public:t-622-arti-13-1:prog2|Programming Assignment 2 - Competition]]         |
-|:::|Mar 08|     13|Uncertainty      |
+|:::|Mar 08|     10|Planning      |
-|  9|Mar 11|     14|Bayesian Networks  |
+|  9|Mar 11|     13, 14|Uncertainty, Bayesian Networks  |
-|:::|Mar 14|    Lab|Lab 4 - Bayesian Networks  |
+|:::|Mar 14|    Lab|[[Lab 5 - Bayesian Networks]]  |
-|:::|Mar 15|  18-21|Machine Learning  |
+|:::|Mar 15|  14|Bayesian Networks  |
-|  10|Mar 18|  18-21|Machine Learning, Decision Trees  |
+|  10|Mar 18|  18-21, 18.3|Machine Learning, Learning Decision Trees  |
-|:::|Mar 21|    Lab|Lab 5 - Learning Decision Trees   |
+|:::|Mar 21|    Lab|[[Lab 6 - Learning Decision Trees]]  |
 |:::|Mar 22|     25|Robotics  |
 |  11|Mar 25|     15|Probabilistic Reasoning over Time  |
 ^ Easter ^^^^
-|  12|Apr 04|    Lab|Lab 6 - Particle Filtering  |
+|  12|Apr 04|    Lab|[[Lab 7 - Particle Filtering]]  |
 |:::|Apr 05|       |Wrap-Up  |
 |  13|Apr 08|       |Project Presentations  |