| Name | KnightTour/KnightTour-int-s1/ KnightTour-05-int.xml |
| MD5SUM | 5aa02d8e33e0310131c8602cbce67fff |
| 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.033151 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 27 |
| Number of domains | 1 |
| Minimum domain size | 25 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":25,"count":25}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":23},{"degree":3,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":2,"count":26},{"arity":25,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 25 |
| Distribution of constraint types | [{"type":"intension","count":25},{"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: