instances/knight_tour_n6__v3_h.json

{
  "name": "knight_tour_n6__v3_h",
  "problem_type": "knight_tour",
  "params": {
    "n": 6
  },
  "prompt": "Find an open knight's tour on an 6x6 chessboard that starts at cell 0 (row 0, column 0). A knight's tour visits every cell exactly once via knight moves; cells are numbered in row-major order so cell k is at row k//6, column k%6. A knight move between cells a and b changes the row by 1 and column by 2, or row by 2 and column by 1.\n\nReturn a list of 36 integers giving the cell visited at each step (a permutation of 0..35 starting with 0), or state \"UNSATISFIABLE\" if no such tour exists.\n\nPartial assignment (fixed values that must be respected):\n- x[3]=17, x[6]=24, x[17]=30, x[19]=6, x[29]=25, x[32]=21, x[34]=23\nReturn a complete solution consistent with these fixed assignments.",
  "satisfiable": true,
  "solution": {
    "x": [
      0,
      8,
      4,
      17,
      28,
      32,
      24,
      20,
      7,
      18,
      31,
      27,
      35,
      22,
      11,
      15,
      26,
      30,
      19,
      6,
      2,
      13,
      9,
      5,
      16,
      3,
      14,
      1,
      12,
      25,
      33,
      29,
      21,
      34,
      23,
      10
    ]
  },
  "difficulty": {
    "solve_time_ms": 6415.9,
    "search_space": 371993326789901217467999448150835200000000,
    "num_variables": 36,
    "num_constraints": 39,
    "num_edges": -1,
    "backend": "pycsp",
    "solve_tier": "hard",
    "solve_pct_global": 97.93,
    "solve_pct_type": 62.5
  },
  "partial_assignment": {
    "x": {
      "3": 17,
      "6": 24,
      "17": 30,
      "19": 6,
      "29": 25,
      "32": 21,
      "34": 23
    }
  }
}