CSE 537 Project 3: Golomb Ruler
(100 points, Due Oct 20th 11:59PM)

A Golomb Ruler of order M and length L consists of M marks placed at unit intervals (i.e. integer positions) along an imaginary ruler such that the differences in spacing between every pair of marks are all distinct, i.e. no two pairs of marks are the same distance apart. The number of marks on the ruler is its order, and the largest distance between two of its marks is its length.

For example the four marks placed at 0, 1, 4 and 6 constitutes a Golomb ruler of order 4 and length 6.

If a solution exists for length L find an optimal length ruler, that is one for which no shorter length ruler exists for M marks.

Generate statistics on the number of consistency checks performed for CSP solution with plain Backtracking (BT), BT+MRV+ Forward Checking (FC).

Submission:

On the due date you should upload a zip file containing:

• Source code with good documentation
• A trace of the execution of each program
• A report containing Test Case Document information.