-------------------
Lab assignment #2:
-------------------

Important points:

1. what is the problem? -> walls of the museum
	- give examples and solutions to have students understand
	- have the students play one or two games

2. how is it related to a tree of possibilities?
	- note: such a tree is never implemented but simulated
	- but to picture the way the search is performed, it is very important
	- draw search trees for simple problems

3. highlight the connection between such a tree and DFS
	- DFS considers a choice and goes all the way down to a complete instanciation, 
		and then check if this instanciation is a solution

4. explain how DFS works
	- how it relates to stacks
	- review the algorithm

5. how constraints can be used to speed-up the search
	- pruning branches

------------------

To Do:

1. analyze (theoretically) the cost of DFS for the museum problem, depending on the
	size n of the museum

2. implement an algorithm to solve this problem:
	- such an algorithm implements DFS
	- + checks that constraints are satisfied to enhance the solving process

3. write a report

-------------------

Important:

1. make sure the program runs on text files specifying the problem, whose description 
	is given in the assignment
2. describe the test files you used to put your algorithm to the test
3. you can use the stack provided in java 	

--------------------