Differences

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

--- public:t-622-arti-15-1:prog1 [2015/01/22 17:12] – stephan
+++ public:t-622-arti-15-1:prog1 [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 23: / Line 23: @@
 Your actions have the following costs:
-  * 1 + 15*D, if you TURN_OFF the robot in the home location and there are D dirty cells left
+  * 1 + 50*D, if you TURN_OFF the robot in the home location and there are D dirty cells left
-  * 100 + 15*D, if you TURN_OFF the robot, but not in the home location and there are D dirty cells left
+  * 100 + 50*D, if you TURN_OFF the robot, but not in the home location and there are D dirty cells left
   * 5 for SUCK, if the current location of the robot does not contain dirt
   * 1 for SUCK, if the current location of the robot contains dirt
@@ Line 46: / Line 46: @@
   - Post the results (number of state expansions, maximum size of the frontier, cost of the found solution) on Piazza, to see how well you are doing compared to the other students.
   - Optionally (up to 10% bonus points): Implement detection of revisited states in A*-Search. Re-run the experiments and comment on the difference in the results.
-  - Try to improve your heuristics, but make sure that it does not increase the overall runtime of search algorithm. You can easily create a heuristics that tells you the optimal costs but is as expensive as a blind search. Try to avoid this.
+  - Try to improve your heuristics while keeping it admissible, but make sure that it does not increase the overall runtime of the search algorithm. You can easily create a heuristics that tells you the optimal costs but is as expensive as a blind search. Try to avoid this.
 ===== Material =====