MiniZinc Challenge 2026 Results

• MiniZinc Challenge
• »Challenge 2026
• »Results

Entrants

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

• Atlantis (description).
• Choco-solver (CP) (description).
• Choco-solver (CP+LCG) (description).
• Crusher (description).
• CUFE (description).
• JaCoP (description).
• NuCS (description).
• OR-Tools CP-SAT (description).
• OR-Tools CP-SAT LS (description).
• Parasol-e (description).
• Parasol-i (description).
• PicatSAT (description).
• Pumpkin (description).
• QiuQi-MIXSolver (description).
• Sabori CSP (description).
• SICStus Prolog (description).
• Yuck (description).

In addition, the challenge organisers entered the following systems (or received late entries):

• Cbc (description). Translates to MILP, uses Cbc version 2.10.13.
• Chuffed (description). A C++ FD solver using lazy clause generation.
• CpoFzn (description). Uses IBM ILOG CP Optimizer version 22.1.2.
• CPLEX (description). Translates to MILP, uses IBM ILOG CPLEX Optimizer version 22.1.2.
• Gecode (description). A C++ FD solver.
• Gecode/Dexter (description).
• Gecode + Scheduling Portfolio (experimental) (description). An experimental build of Gecode.
• Gurobi 12 (description). Translates to MILP, uses Gurobi version 12.0.3.
• HiGHS (description). Translates to MILP, uses HiGHS version 1.14.0.
• Huub (description). An LCG solver.
• Huub (Difference Logic) (description).
• MiniFolio (description).
• SCIP (description). Translates to MILP, uses SCIP version 10.0.2.
• Thornbill (description). A CP solver designed to run on microcontrollers.

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 2026 are

Description of Results

All times are given in milliseconds.

Scores of 0, 1 and 2 are used in the tables rather than 0, 0.5 and 1.

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, and -open (for the parallel portfolio solvers 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.

Detailed Results

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.

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.

The files on this page are for MiniZinc version 2.9.7.