CP(M) 2020
This is a rough cut and is open for discussion. 
I assume there will be 2 or 3 lectures in one day, once a week for 10 weeks.

Week 1  14/01
Introduce CP, MiniZinc: crystal maze, fruit shop

Week 2  21/01    HAND OUT EX01
MiniZinc: start 2020, Production Planning, Guard Rota, small TSP
Homework feedback: generate all permutations, all choices, power set
Explain: global cardinality and lex constraint ... see guardRota
         rough sketch of two models for EX01

Week 3  28/01
Backtracking search and thrashing: bt, cbj, fc 
Small minizinc exercise: clique & colour

Week 4  04/02
AC ...
Regular & Circuit constraints
Intro to choco4 (start 2020)

Week 5  11/02   HAND IN EX01, HAND OUT EX02
Introduction to exercise 2 
Heuristics: variable & value ordering
nQueens: to show encodings and effects of heuristics
Bin Packing ... show effect of variable & value ordering
Team Building with Costs (looks like bin packing), to show different encodings and heuristics

Week 6  18/02
Phase Transition explained ... Number partitioning as example of phase transition
Team Building: exercise 1 in choco!
Optional: magic square, workforce management

Week 7  25/02
Feedback on Ex01
weeSeepy ... implementing a small CP toolkit
Optional: golomb ruler, Graeco/Latin 

Week 8  03/03
On Search (CMcC)

Week 9  10/03  HAND IN EX02
Local Search: HC, SA, TS, GLS, GA, ACO, MinConflicts + TS, all things voodoo ...
Optional: meeting scheduling problem 

Week 10  17/03
Local Search: HC, SA, TS, GLS, GA, ACO, MinConflicts + TS, all things voodoo ...
Min-Conflicts https://en.wikipedia.org/wiki/Min-conflicts_algorithm 


NOTE: some problems that may be covered (selected from) are as follows
Number Partitioning, JSSP, Golomb Rulers, Magic Square, Graph Colouring, 
small TSP in MiniZinc, Latin/Greek square, Round-robin scheduling,
Max Clique, Max Common Subgraph, Car Sequencing, Rehearsal problem, 
workforce management, puzzles from daily newspapers puzzle pages, meeting scheduling problem