CS530 CSP Assignment (Due October 19, 1999)
Your assignment is to color a map
of Europe and North Africa. Your map should obey the following
constraints:
- Use only four colors.
- If two countries have a common border, they must have different
colors.
- The ocean (including the Mediterranean Sea) should be treated as
one of the countries.
- Regions that are non-contiguous but that are part of the same
country should have the same color. Examples: Northern Ireland and
the rest of the UK, Kallinigrad and the rest of Russia, France and
Corsica, Italy, Sardinia, and Sicily, and so on. You may ignore the
smaller islands in the Mediterranean.
To solve this problem, you should first construct a graph where the
nodes are regions and there is an arc between each pair of regions
that share a boundary. Then you should add arcs between each pair of
regions that belong to the same country. The graph will therefore
have two kinds of arcs corresponding to the two kinds of constraints:
different-color constraints and same-color constraints. NOTE: You
may work together to define and debug this graph!
You should encode this as a CSP using the code from the textbook.
Show one solution found by using csp-backtracking-search
and one solution found by csp-forward-checking-search.
Compare the search performance of these two algorithms.
Turn in a source listing, the two solutions found by the two
algorithms, and the report comparing the search performance of the two
algorithms.
Last updated Mon Oct 11 22:40:28 1999 tgd