Constraint solver implementation
The coursework task was to build a simple constraint satisfaction solver that was able to read a generic language designed to express combinatorial problems.
The students can then model combinatorically hard problems using this language and find solutions for the problems via the efficient techniques implemented in their constraint solver.
The skills taught in the coursework were:
- Parsing a simple user-defined grammar
- Design and implementation of a constraint solver
- Benchmarking of different search algorithms to compare their strengths and weaknesses
Module
Year 4 Undergraduate; “Constraint Programming”
Keywords
Constraint Solver, Search Algorithms
Staff
[Joan Espasa]{jea20} and [Ian Miguel]{ijm}