Every Group Has at Least N

Every group of the stated kind — every row, every column, or every cell's neighborhood — contains at least N Suspects (or Innocents). The constraint is applied independently to each group simultaneously; if any single group falls below N, the clue is violated. This sweeping lower bound becomes powerful when combined with a global total count: if you know every row has at least N Suspects and there are R rows, the total must be at least R × N. From there, an exact total count or per-group upper bounds can often force the entire distribution. Most difficult when N is high relative to group size, since it leaves little room for Innocents.