NOPT042 Constraint programming (Fall 2023)

In the tutorial we will be modeling constraint problems in the logic-based multi-paradigm language Picat (Pattern-matching, Intuitive, Constraints, Actors, Tabling).

Credit requirements

There will be 12 homework assignments each of which is worth 1 point. In order to get the credit, you must gain at least 8 points, out of which at least 4 points must be from the second half of the semester (assignments 7-). Expect increasing complexity of the assignments as the semester progresses. There will be an additional option to get at most 4 points after the end of classes for solving somewhat harder problems.

The solutions to the homework assignments must be 100% your own work. Do not discuss them with anyone but me, do not search for solutions on the internet, and do not share your code.

ReCodEx and GitHub

Homework assignments will be posted in ReCodEx. The deadlines will be set to the beginning of the next tutorial, unless stated otherwise. Materials from the tutorial are posted below as PDFs. The source codes and live notebooks are available on GitHub.

Tutorial schedule

Before the first tutorial

1st tutorial (Oct 2)

2nd tutorial (Oct 9)

3rd tutorial (Oct 16)

4th tutorial (Oct 23)

5th tutorial (Oct 30)

6th tutorial (Nov 6)

7th tutorial (Nov 13)

8th tutorial (Nov 20)

9th tutorial (Nov 27)

10th tutorial (Dec 4)

11th tutorial (Dec 11)

12th tutorial (Dec 18)

13th tutorial (Jan 8)


Frequently asked questions (FAQ)