1Check region B
region B has only one remaining candidate: row 2, column 3. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 1. Place one cat, then exclude 13 other cells.Original puzzle gm-8-0057
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.
B is the one-cell region r2c3. Placing it reduces A to r1c1. Together with the bottom-row given, those upper anchors narrow G’s lower-left possibilities.
8×8 · 1 fixed cats · 7 explained deductions. Region sizes: A: 6 · B: 1 · C: 12 · D: 10 · E: 18 · F: 2 · G: 8 · H: 7.
G resolves at r7c4. Its neighborhood removes r6c5, helping the narrow F region settle at r6c7.
r6c5 has a different region label from r7c4, but shares its corner. Treat that local contact separately from the longer column-4 exclusions.
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.
A A A A C C C C A E B A C C C D E E E E C C C D G E E E C C D D G G E E E D D D G G G E E E F D H H G G E E F D H H H H H E E D
Fixed cats: row 8, column 2. One cat is required in each row, column and region.
region B has only one remaining candidate: row 2, column 3. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 1. Place one cat, then exclude 13 other cells.region A has only one remaining candidate: row 1, column 1. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 2. Place one cat, then exclude 8 other cells.region G has only one remaining candidate: row 7, column 4. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 3. Place one cat, then exclude 8 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 4. Place one cat, then exclude 7 other cells.row 5 has only one remaining candidate: row 5, column 5. Every other cell is excluded by earlier placements or deductions. Place the cat here.
Before step 5. Place one cat, then exclude 3 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 3 has only one remaining candidate: row 3, column 6. 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: r1c1, r2c3, r3c6, r4c8, r5c5, r6c7, r7c4, r8c2.
gm-8-0054 · 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-0012 · 6×6 · challenge
Compare this route with candidate locks, and check why that different rule is needed.
Read this walkthrough →