Domino Loop

Candidates that close into a loop rule out what lies inside or outside it.

All candidates have been entered in the empty cells.

The 16 cells in A

DigitPositions and limits within AMaximum
1At most one in each of block B, block C2
2At most one in each of block D, block E2
3At most one in each of row F, column G2
4At most one in each of row H, column I2
5At most one in each of row H1
6At most one in each of block B, block C2
7At most one in each of block D, block E2
8At most one in each of row F, column I2
9At most one in each of column G1

The maxima total 2 + 2 + 2 + 2 + 1 + 2 + 2 + 2 + 1 = 16. If any digit falls even one short of its maximum, there are at most 15 digits, leaving at least one of the 16 cells in A empty. Every digit in A must therefore reach its listed maximum. Each listed row, column or block must contribute one occurrence to reach that digit's maximum. In each listed row, column or block, its digit must occupy a cell in A.

DigitCandidates marked × to remove
1Outside A in block C
2Outside A in block E
3Outside A in row F, column G
4Outside A in row H, column I
5Outside A in row H
6Outside A in block C
7Outside A in block E
8Outside A in row F, column I
9Outside A in column G

Remove the candidates marked × listed in the table.