MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/knights/
normalized-knights-15-9.xml

Jump to solvers results

General information on the benchmark

Namecsp/knights/
normalized-knights-15-9.xml
MD5SUM4ca04c2b4cff6eaa31c1b1eda93cff1e
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 benchmark62.8454
Satisfiable
(Un)Satisfiability was proved
Number of variables9
Number of constraints36
Maximum constraint arity2
Maximum domain size225
Number of constraints which are defined in extension0
Number of constraints which are defined in intension36
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
AbsconMax 112 pc-w1112277OPTIMUM1 62.8454 110.075
AbsconMax 112 pc-d1112278OPTIMUM1 79.5809 155.054
Sugar v1.13+minisat1112280OPTIMUM1 150.35 152.033
Sugar++ v1.13+minisat-inc1112279OPTIMUM1 176.267 178.223
Concrete + CSP4J - Tabu Engine 2008-05-301112276MSAT (TO)1 3600.05 3602.22
Concrete + CSP4J - MCRW Engine 2008-05-301112275MSAT (TO)1 3600.09 3633.22

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:
159 188 217 186 157 140 111 128 115