Pixel Oracle · Nonogram

Why no guessing is needed

Every published puzzle must have exactly one solution. A deterministic solver then reconstructs every cell through replayable deductions; if it stalls, disagrees with the clues, or cannot replay its proof, the puzzle is rejected.

Updated: · Source: Pixel Oracle validator and public proof contract

Validator version: no-guess-v1

Unique solution verified. Logic-only proof replayed.

A puzzle fails publication when

  • its generated clues do not match its source grid
  • it has zero or more than one solution
  • the deterministic solver needs a guess or exceeds its fixed budget
  • an independent verifier cannot replay the complete proof

Deduction reasons, from simplest to hardest

The same admitted proof data powers the validator report, public facts, result panel and structured page metadata.

  1. full-spanFull spanA run and its required gaps fill the whole available line.■■■ · 3 · ■■■
  2. overlapOverlapAll legal placements share one or more filled cells.··■■· · 4 · ·■■··
  3. completed-runCompleted runA finished run forces its neighboring unknown cells empty.·■■· · 2 · ×■■×
  4. separationSeparationRequired gaps between runs force cells empty.■×■ · 1 1 · ■×■
  5. cross-line-eliminationCross-line eliminationConfirmed information from the other direction removes alternatives.·?· · ↕ · ·×·