How to solve Sudoku: Constraint Programming and MiniZinc
On Wednesday 11th of October Postdoctoral Fellow at the Department of Informatics Jacopo Mauro will give a seminar with the title "How to solve Sudoku with few lines of code: Constraint Programming & MiniZinc" about constraint programming, a paradigm to solve certain interesting and complex problems, like for example Sudoku.
The abstract for the talk is: Optimization is a common form of decision making, and is ubiquitous in our society. Its applications range from solving Sudoku puzzles to arranging seating in a wedding banquet. The same technology can schedule planes and their crews and coordinate the production of steel. Constraint Programming (CP) is paradigm used to solve these complex optimization problems. In this seminar, we'll explain how Sudoku or other games can be solved with few lines of code by exploiting the power of CP that, contrary to the imperative style of programming, it does not require to specify the steps to find a solution. In particular, we'll give an hands on experience of MiniZinc, i.e., the de-facto language for defining constraint problems supported by a variety of state-of-the-art solving tools.