MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/queensKnights/
normalized-queensKnights-8-5-mul.xml

Jump to solvers results

General information on the benchmark

Namecsp/queensKnights/
normalized-queensKnights-8-5-mul.xml
MD5SUM20dab5dec1acf991b1236d2ad4d0004b
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark1.64675
Satisfiable
(Un)Satisfiability was proved
Number of variables13
Number of constraints78
Maximum constraint arity2
Maximum domain size64
Number of constraints which are defined in extension0
Number of constraints which are defined in intension78
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1112201OPTIMUM1 1.64675 1.91298
Sugar v1.13+minisat1112202OPTIMUM1 1.66475 1.94164
AbsconMax 112 pc-w1112199OPTIMUM1 32.2011 35.0888
AbsconMax 112 pc-d1112200OPTIMUM1 32.2191 35.095
Concrete + CSP4J - Tabu Engine 2008-05-301112198MSAT (TO)1 3600.06 3651.03
Concrete + CSP4J - MCRW Engine 2008-05-301112197MSAT (TO)1 3600.08 3620.72

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 1
Solution found:
7 1 4 2 0 6 3 5 30 47 62 21 15