Differences

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

--- public:t-622-arti-15-1:lab_3_-_csps [2015/02/09 13:58] – created stephan
+++ public:t-622-arti-15-1:lab_3_-_csps [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 1: / Line 1: @@
 ====== Lab 3 - Constraint Satisfaction Problems ======
+**Note:** For this lab, you can work together in teams of up to 4 students. However, this is not a necessity. The assignment is small enough to do it alone in which case you may get more experience. You can use [[https://piazza.com/ru.is/spring2015/t622arti|Piazza]] to find team members and discuss problems.
+You will need a Java Development Kit (JDK) and a Java IDE (any text editor should do as well).
+===== Problem Description =====
 The following logic puzzle is known as Zebra Puzzle or Einstein Puzzle (source: [[http://en.wikipedia.org/wiki/Zebra_Puzzle|Wikipedia]]). It was first published in the Life International magazine in 1962. Also, exercise 6.6 in the book is a slight variation of that puzzle.
@@ Line 23: / Line 29: @@
 Now, who drinks water? Who owns the zebra?
 ===== Tasks =====
-  - Model the problem as a CSP, that is define variables, their domains and constraints between them. There are different ways of modelling this. Typically you want to have fewer variables and fewer or simpler constraints.
+  - Model the problem as a CSP, that is define variables, their domains and constraints between them. There are different ways of modelling this. Typically you want to have fewer variables and smaller domains (to reduce the size of the state space) and fewer or simpler constraints (to speed up constraint propagation). What are your variables and their domains?
+  - How big is the state space? Shortly, explain your answer.
   - Download the material below, implement your model (implement all things marked with TODO).
   - Run the program and compare the results. What does that tell you about the usefulness of different propagation algorithms and heuristics for this problem?
 ===== Material =====
-  * {{:public:t-622-arti-14-1:streetpuzzle.zip|java project for the lab}}
+The Java project for the lab can be found on Skel. See, instructions below on how to get it.
 The project contains a Main class which sets up and solves the CSP, as well as some additional classes implementing the constraints. You need to implement a few parts in Main.java and a method in DifferByOneConstraint.java (if you need that constraint). To run the code simply run the Main class or use "ant run" on the terminal.
 ===== Handing In =====
-You can work in groups of up to 4 students, although more than 2 is probably not necessary.
-Hand in a zip file containing:
+Connect to skel.ru.is using your favorite ssh client and unpack the assignment into your home directory by running the following commands:
-  * the answers to the questions above (in a text/pdf/word file)
+<code>
-  * your source code (ideally just the whole project directory)
+[student14@skel ~]$ tar xvf /labs/arti15/lab3/lab3.tar
-To create the zip file you can 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).
+[student14@skel ~]$ cd arti15/lab3
+[student14@skel hw1]$ ls
+answers build.xml dist Makefile questions src
+</code>
+You can copy the code to your own machine for development by using any SCP or SFTP client (e.g., WinSCP). However, you need to copy it back to skel before handing in.
+To answer the questions run ''make answers'' while being in the directory containing ''Makefile''.
+Single answers will be put into files called ''answers/answerX.Y.txt'', which you can also edit.
+Finally, to hand in your answers run ''make handin'' while being in the directory containing ''Makefile''.
+This should produce a file ''/labs/art15/.handin/lab3/student14/handin.tar.gz''. You can check if it exists using the ls command or by running ''rutool check -c arti15 -p lab3''.