Differences

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

--- public:t-622-arti-12-1:prog1 [2012/02/08 18:02] – [Tasks] stephan
+++ public:t-622-arti-12-1:prog1 [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 43: / Line 43: @@
 ===== Material =====
   * {{:public:t-622-arti-12-1:vacuumcleaner_utility_agent.zip|java project for the agent development}}
-  * some bigger environments will follow soon
+  * {{:public:t-622-arti-12-1:bigger_worlds.zip|some bigger test environments}} (updated 14.02.2012, see the worlds.txt file to see how big the state spaces are)
 The files in the archive are similar to those in the first lab.
@@ Line 53: / Line 53: @@
   - Setup the simulator as shown in this picture:
     {{:public:t-622-arti-12-1:gamecontroller-settings.png?nolink&|}}
-  - If there is a second role called "R in the game, leave it as "Random".
+  - If there is a second role called "Random" in the game, leave it as "Random".
   - Run the "Main" class in the project. If you added your own agent class, make sure that it is used in the main method of Main.java. You can also execute the "ant run" on the command line, if you have [[http://ant.apache.org/|Ant]] installed. The output of the agent should say "NanoHTTPD is listening on port 4001", which indicates that your agent is ready and waiting for messages to arrive on the specified port.
   - Now push the "Start" button in the simulator and your agent should get some messages and reply with the actions it wants to execute. At the end, the output of the simulator tells you how many points your agent got: "Game over! results: 0". Those points correspond more or less with negated costs. That is, more points means the solution had lower costs.
@@ Line 66: / Line 66: @@
   * Implement a class "State" that contains all the information about a state that you need to keep track of. The State class should have a method that returns a list of all moves that are legal in the state and a method that takes a move and returns the state that results from executing the move.
   * Distinguish between nodes of the search tree and states! Each node has an associated state, but there may be several nodes that have the same state associated. In addition to a state, a node contains a reference to is parent (unless it is the root node), the move that was taken to get to the node and (if necessary) the path cost associated for getting from the root node to the node.
+For developing an admissible heuristics:
+  * Remember: The cost of the optimal solution of a relaxation of the problem is an admissible heuristics. How could you relax the problem, such that you instantly know the cost of the optimal solution?
+  * The maximum of two admissible heuristics is again admissible. The same holds for consistent heuristics. So, if you have two admissible heuristics you can simply take the maximum value of both and you will get an admissible heuristics that is at least as good.
 ===== Handing In =====
@@ Line 74: / Line 78: @@
 To create the zip file you just edit the "student" property in the build.xml and call the "zip" target using ant (execute "ant zip" in the directory containing the build.xml).
-The deadline is Sunday, 12.02.2012.
+The deadline is Tuesday, 14.02.2012. You can still hand in after the deadline, but your grade will be lowered by 0.5 for each day your submission is late.