| Name | KnightTour/KnightTour-ext-s1/ KnightTour-15-ext06.xml |
| MD5SUM | af3f6bb9b1ca00becd13f0e7ebc5af3a |
| 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 | 17.3587 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 225 |
| Number of constraints | 47 |
| Number of domains | 1 |
| Minimum domain size | 225 |
| Maximum domain size | 225 |
| Distribution of domain sizes | [{"size":225,"count":225}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":223},{"degree":3,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 225 |
| Distribution of constraint arities | [{"arity":2,"count":1},{"arity":6,"count":45},{"arity":225,"count":1}] |
| Number of extensional constraints | 45 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":45},{"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: