Name | KnightTour/KnightTour-ext-s1/ KnightTour-17-ext02.xml |
MD5SUM | e012389e7b96b23a2cd1273ccb482cfe |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.030643 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 289 |
Number of constraints | 291 |
Number of domains | 1 |
Minimum domain size | 289 |
Maximum domain size | 289 |
Distribution of domain sizes | [{"size":289,"count":289}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":287},{"degree":3,"count":2}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 289 |
Distribution of constraint arities | [{"arity":2,"count":290},{"arity":289,"count":1}] |
Number of extensional constraints | 289 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":289},{"type":"allDifferent","count":1},{"type":"instantiation","count":1}] |
Optimization problem | NO |
Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: