{
  "context": "Evaluates whether the solution leans on unique-random's exhaustiveUniqueRandom generator to drive a fair seat allocator that cycles through a numeric range without repeats. Scoring checks correct use of the callable-and-iterable interface, reliance on the exhaustive cycle semantics, and proper handling of boundary and degenerate ranges via the package.",
  "type": "weighted_checklist",
  "checklist": [
    {
      "name": "Exhaustive factory",
      "description": "Instantiates unique-random's exhaustiveUniqueRandom with the provided min and max bounds to power the allocator instead of custom randomness or the consecutive variant.",
      "max_score": 40
    },
    {
      "name": "Cycle coverage",
      "description": "Uses the package's exhaustive generator behavior so each value in the inclusive range appears once per round before any repeat, avoiding manual shuffle logic that bypasses exhaustiveUniqueRandom.",
      "max_score": 20
    },
    {
      "name": "Boundary shift",
      "description": "Preserves the generator's guarantee that the first value after a pool reset differs from the last emitted value, rather than resetting state in a way that allows immediate repeats.",
      "max_score": 10
    },
    {
      "name": "Callable iterable",
      "description": "Exposes the allocator as both a callable and iterable by forwarding to the exhaustiveUniqueRandom return value so calls and iteration share one stream and state.",
      "max_score": 20
    },
    {
      "name": "Single-value range",
      "description": "Handles equal min and max by relying on exhaustiveUniqueRandom's constant-output behavior (or equivalent while still using the package) instead of bypassing the package entirely.",
      "max_score": 10
    }
  ]
}