My Constraint Programming Blog

The results of MiniZinc Challenge 2010 has been published: MiniZinc Challenge 2010 Results:

The entrants for this year (with their descriptions, when provided):

• Gecode (description). A C++ FD solver.
• JaCoP (description). A Java FD solver.
• Fzn2smt (description). Translates to SMT, uses Yices.
• SCIP. A CP/MIP solver.

In addition the challenge organisers entered the following FlatZinc implementations:

• Chuffed (description). A C++ FD solver using Lazy clause generation.
• Fzntini. Translates to SAT, uses TiniSAT.
• G12/FD. A Mercury FD solver (the G12 FlatZinc interpreter's default solver).
• G12/CPLEX. Translates to MIP, uses CPLEX12.1.

As per the challenge rules, these entries are not eligible for prizes, but do modify the scoring results. Furthermore, entries in the FD search category (Gecode, JaCoP, Chuffed, G12/FD) were automatically included in the free search category, while entries in the free search category (Fzn2smt, Fzntini, SCIP, CPLEX and promoted FD entries) were automatically included in the parallel search category.

I'm really curious about Chuffed (which I have not tested). As far as I know, it is not public available.

Results

This year the results are not in fixed result lists. Instead there is a Javascript application where one can choose different combinations of solvers and problems.

Update some hours later: I have been informed that my summaries was not correct so I have removed them to not confuse anyone. Sorry for any confusions. Please see the Results page.

See also

The results of the earlier MiniZinc Challenges:
* MiniZinc Challenge 2009 Results. Results of the MiniZinc challenge 2009.
* MiniZinc Challenge 2008 Results. Results of the MiniZinc challenge 2008