Lab 4 2014
From 6.034 Wiki
(Difference between revisions)
| Line 58: | Line 58: | ||
=== Useful Functions === | === Useful Functions === | ||
| - | Here are some useful functions that you should use to implement the | + | Here are some useful functions defined in <tt>csp.py</tt> |
| + | that you should use in your code to implement the above algorithms: | ||
<tt>Variable</tt>: representation of a variable in the problem | <tt>Variable</tt>: representation of a variable in the problem | ||
| Line 79: | Line 80: | ||
=== Testing === | === Testing === | ||
| - | For testing, we have provided <tt>moose_csp.py</tt>, an implementation of the seating problem involving a | + | For unit testing, we have provided <tt>moose_csp.py</tt>, an implementation of the seating problem involving a Moose, Palin, McCain, Obama, Biden and You -- in terms of the framework as defined in <tt>csp.py</tt>. |
Running: | Running: | ||
| Line 96: | Line 97: | ||
</pre> | </pre> | ||
| - | Should return search trees for the B,Y,R, state coloring problem from the 2006 Quiz 2. | + | Should return the expected search trees for the B,Y,R, state coloring problem from the 2006 Quiz 2. |
== LEARNING == | == LEARNING == | ||
Revision as of 19:14, 22 October 2010
This problem set is due Friday, November 5th. If you have questions about it, ask the list 6034tas@csail.mit.edu.
