1Check region A
region A has only one remaining candidate: row 1, column 5. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 1. Place one cat, then exclude 11 other cells.Original puzzle gm-8-0055
By GridMew · Published 15 October 2026 · Updated 16 October 2026
8 × 8 practice
Read the starting position, follow the deductions, and check the move that is easy to misread.
Coordinates such as r2c3 mean row 2, column 3. Count rows from the top and columns from the left.
A at r1c5 and F at r6c7 each force a cat. Use both before choosing among H’s many lower cells. Their row, column and neighborhood effects reduce H to r8c6.
8×8 · 1 fixed cats · 7 explained deductions. Region sizes: A: 1 · B: 14 · C: 4 · D: 20 · E: 13 · F: 1 · G: 2 · H: 9.
The H cat removes r4c6 through column 6, well above its local neighborhood. That long effect matters when the solve returns to the upper rows.
r4c6 is not safe just because it is four rows above r8c6. Both would occupy column 6, which admits one cat.
Green marks the cell being discussed, not a cat to place. This is the position before step 3; compare the deduction below.
Each line is one row, left to right. Matching letters belong to the same connected region.
B B B B A D D D B B B B B D D D B B B C C D D D B B E C C D D D E E E E D D D D E E E E H H F D G E E H H H D D G E E H H H H D
Fixed cats: row 3, column 4. One cat is required in each row, column and region.
region A has only one remaining candidate: row 1, column 5. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 1. Place one cat, then exclude 11 other cells.region F has only one remaining candidate: row 6, column 7. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 2. Place one cat, then exclude 14 other cells.region H has only one remaining candidate: row 8, column 6. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 3. Place one cat, then exclude 5 other cells.region G has only one remaining candidate: row 7, column 1. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 4. Place one cat, then exclude 5 other cells.column 3 has only one remaining candidate: row 5, column 3. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 5. Place one cat, then exclude 2 other cells.row 4 has only one remaining candidate: row 4, column 8. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 6. Place one cat, then exclude 1 other cells.row 2 has only one remaining candidate: row 2, column 2. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 7. Place one cat, then exclude 0 other cells.The final cats satisfy every row, column and region quota, with no edge or corner contact.
Cat positions: r1c5, r2c2, r3c4, r4c8, r5c3, r6c7, r7c1, r8c6.
gm-8-0030 · 8×8 · practice
Practice single-candidate placements on another 8×8 board.
Read this walkthrough →gm-6-0009 · 6×6 · practice
Transfer single-candidate placements to a 6×6 grid; compare how the candidates change.
Read this walkthrough →gm-6-0003 · 6×6 · challenge
Compare this route with candidate locks, and check why that different rule is needed.
Read this walkthrough →