CP(M) 2018
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  09/01
Introduce CP, MiniZinc: crystal maze, fruit shop

Week 2  16/01    HAND OUT EX01
MiniZinc: start 2018, 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  23/01
Backtracking search and thrashing: bt, fc, AC, MAC
Small minizinc exercise: clique & colour

Week 4  30/01
A bit about specialised algorithms for clique (see above), example of Branch and Bound
MiniZinc: paint shop, nurse roster, a control problem (regular & globalCardinality)

Week 5  06/02   HAND IN EX01, HAND OUT EX02
Choco: start2017, crystal maze, EX01 in choco (two models!)
allDifferent, apply to sudoku and possibly also nqueens (CMcC)

Week 6  13/02
Heuristics: variable & value ordering
Team building with costs (looks like bin packing), to show different encodings and heuristics
nQueens, to show encodings and heuristics
Small choco exercise: magic square, workforce management

Week 7  20/02
Feedback of EX01
Job Shop Scheduling (with heuristics)
Small choco exercise: golomb ruler, Graeco/Latin square

Week 8  27/02
Discrepancy Search (CMcC)
Parallel Search (CMcC)
Small exercise (choco or minizinc): prob039, the rehearsal problem 

Week 9  06/03  HAND IN EX02
Phase Transition explained
Number partitioning as example of phase transition.
Small exercise (choco or minizinc): workforce management

Week 10  13/03
Local Search: HC, SA, TS, GLS, GA, ACO, all things voodoo ...


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, KA school timetable ...