Skip to main content


Primary supervisor

Peter Stuckey


  • Guido Tack
  • Laurent Michel, University of Connecticut

Mini-CP is a minimal form of constraint programming solver, designed to allow for easy experimentation and learning. 

One of the most efficient approaches to discrete optimisation solving is using lazy clause generation, which is a hybrid SAT/CP approach to solving problems.  But MiniCP does not currently support this. 

Using a version of Mini-CP written in C++ (, this project will build a Mini-LCG (minimal LCG solver) by combining MiniSAT a venerable but clean SAT solver with MiniCP in C++.  

Student cohort

Double Semester

Required knowledge

C++ expert programming

Understanding SAT or CP solving would be an advantage but can be learnt in the project.