See the assignment turn-in page (last modified on 9 February 2004) for instructions on turning in your assignment.
The objective of the puzzle is to arrange all seven tans to form a shape described only in outline. For example, the simple puzzle
has the solution
Your program should output the solution to the input puzzle or impossible
if the puzzle can't be solved. If the puzzle has a solution, the tans should
be output one per line, with each tan being output as a sequence of vertices
in either clockwise or counter-clockwise order starting from an arbitrary
vertex on the tan. The tan vertices should be given in the coordinate
system defined by the input puzzle.
For example, the following input describes the square puzzle given in the Background Section:
-1 -1 -1 3 3 3 3 -1
|
![]()
|
-1 -1 -1 3 1 1 -1 3 3 3 1 1 -1 -1 0 0 2 0 1 -1 3 1 1 -1 3 -1 0 0 2 0 1 1 2 0 3 1 2 2 1 1 3 3 2 2 3 1
|
![]()
|
/export/home/class/cs-509/pa4
; these
files can be recognized by their two-letter filenames.
The program tg-viewer
can be used to view either the input to or
output from your pprogram; in either case, tg-viewer
reads fron std-in.
$tg-viewer
< cn $ tg-solver < cn |tg-viewer
This page last modified on 18 March 2004.