MiniZinc Challenge 2023 Results


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

In addition, the challenge organisers entered the following FlatZinc and MiniZinc implementations:

As per the challenge rules, these entries are not eligible for prizes, but do modify the scoring results.

Summary of Results

The results for the MiniZinc Challenge 2023 are

Category Gold Silver Bronze
Fixed OR-Tools SICStus Prolog Choco 4
Free OR-Tools PicatSAT iZplus
Parallel OR-Tools PicatSAT Choco 4
Local Search Yuck

Description of Results

All times are given in milliseconds.

A score of 0.0 indicates a worse answer in quality (worse objective, no proof of optimality, or no answer for satisfaction problems).
A score of 1.0 indicates a better solution in quality. When the quality is the same, the 1.0 purse is split with respect to time used.

If a promoted entry does not recognize an option (or states that it is just ignored), times and solutions from the previous category are used for scoring. The suffixes -fd, -free, -par or -open (for the parallel portfolio solver entered) at the end of the solver names indicate which configuration the solvers were run with.

The time limit includes both MiniZinc compilation and solving.

In the Status column:

  • S indicates that a solution was found,
  • C indicates that the search was complete,
  • ERR indicates an incorrect answer or the solver aborted,
  • ERR indicates that flattening aborted (time-out or out-of-memory),
  • UNK indicates that no answer was returned in the time limit.

Download all problems

All problems are available in a zipped tar-ball here.


Select a list of solvers and benchmarks and click on "Compute Results" to score the solvers against each other on the selected benchmarks. The entrants for each of the fd search, free search and parallel search categories can be selected with the corresponding buttons.

Solver selection: Problem selection:

Plot settings:
Note that plotting takes time.
Create plots for each instance
Time axis scale:
Default Linear Log
Plot lines shape:
Steps Lines
Area scoring settings:


Total per problem:

Solver Score Score Incomplete Score Area
Problem Solver Score Score Incomplete Score Area

Individual results:

Problem Instance Solver Status Time Objective Score Score Incomplete Score Area

Objective plots for each instance:

Problem Instance Plot

Score development over time:

Global constraint per model

The following table lists the global constraints used by each model in this year's challenge. In addition, the columns RC and SBC, respectively, indicate whether the model contains redundant or/and symmetry breaking constraints.

Model RC SBC Global constraints used
chessboard X X global_cardinality, lex_lesseq
code-generator X X all_different, cumulative, decreasing, diffn, diffn_nonstrict, maximum, member, minimum, table, value_precede_chain
elitserien all_different, global_cardinality_closed, inverse, member, regular
evm-super-compilation X global_cardinality_low_up
gametes X all_different_except_0, count, count_geq, increasing
kidney-exchange X all_different, bin_packing, seq_precede_chain
mrcpsp X cumulative
multi-agent-graph-coverage all_different
pennies-opt X all_different, decreasing
roster at_least, at_most, exactly
roster-shifts-bool X
speck-optimisation all_equal
sudoku_fixed all_different
test-scheduling X X cumulative, disjunctive, value_precede_chain
travelling-thief all_different, inverse
vrplc X circuit, cumulative
yumi-static all_equal, all_different, circuit, cumulative, diffn, increasing, table, value_precede, value_precede_chain

The files on this page are for MiniZinc version 2.7.6.