{
  "context": "Evaluates how well the solution leverages the h3 grid navigation API to build neighborhood disks and rings, verify adjacency, and compute minimal routes between H3 cells. Emphasis is on correct use of h3 primitives rather than general logic.",
  "type": "weighted_checklist",
  "checklist": [
    {
      "name": "Disk queries",
      "description": "Uses h3.grid_disk on the provided origin with the requested radius to return unique cells that include the origin and respect expected counts (k=1 -> 7, k=2 -> 19).",
      "max_score": 25
    },
    {
      "name": "Ring queries",
      "description": "Uses h3.grid_ring for exact-distance neighborhoods, producing k=2 rings of length 12 without the origin and without overlap with the k=1 ring.",
      "max_score": 25
    },
    {
      "name": "Adjacency check",
      "description": "Relies on h3.are_neighbor_cells to evaluate pairwise adjacency, returning True for radius-1 ring cells relative to the origin and False for radius-2 ring cells at the same resolution.",
      "max_score": 20
    },
    {
      "name": "Path construction",
      "description": "Uses h3.grid_path_cells to build ordered paths and confirms path length with h3.grid_distance + 1 while ensuring each consecutive cell pair is neighbor-connected.",
      "max_score": 30
    }
  ]
}