MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/knights/
normalized-knights-25-9.xml
MD5SUM2c2a315f78e02a36f39cc2b3c6ab1a62
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 benchmark276.481
Satisfiable
(Un)Satisfiability was proved
Number of variables9
Number of constraints36
Maximum constraint arity2
Maximum domain size625
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-w1112265OPTIMUM1 276.481 645.379
AbsconMax 112 pc-d1112266OPTIMUM1 387.217 927.222
Sugar++ v1.13+minisat-inc1112267OPTIMUM1 613.784 619.606
Sugar v1.13+minisat1112268OPTIMUM1 614.707 620.751
Concrete + CSP4J - Tabu Engine 2008-05-301112264MSAT (TO)1 3600 3616.02
Concrete + CSP4J - MCRW Engine 2008-05-301112263MSAT (TO)1 3600.09 3625.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:
465 488 439 390 417 368 341 364 438