LinkedIn Queens #935 Answer & Hints – November 21, 2026
Independent walkthrough by Queens Gamers · · 9×9 · Play on LinkedIn
LinkedIn Queens hints and the full solution for puzzle #935 on November 21, 2026. Follow 18 verified deductions on this 9×9 board, starting with region 7.
Region 1 (7 cells) · Region 2 (12 cells) · Region 3 (10 cells) · Region 4 (21 cells) · Region 5 (7 cells) · Region 6 (3 cells) · Region 7 (1 cell) · Region 8 (10 cells) · Region 9 (10 cells)
LinkedIn Queens #935 hints
Open one hint at a time. Reveal the full answer only when you are ready.
Hint 1
Start with region 7. Its candidates are R2C8. Which placement is forced? Remember that each row, column and region needs exactly one Queen.
Starting board: no deductions applied yet.
1 cells
R2C8Hint 2
Observe: region 7 has only one remaining candidate: R2C8.
Rule: every region needs exactly one Queen.
Therefore: place a Queen at R2C8. The 20 cells marked × conflict with it by row, column, region or diagonal adjacency.
Board after step 1; earlier deductions are already applied.
1 cells
R2C821 cells
R1C7, R1C8, R1C9, R2C1, R2C2, R2C3, R2C4, R2C5, R2C6, R2C7, R2C8, R2C9, R3C7, R3C8, R3C9, R4C8, R5C8, R6C8, R7C8, R8C8, R9C8Hint 3
Step 1: Observe: region 7 has only one remaining candidate: R2C8.
Rule: every region needs exactly one Queen.
Therefore: place a Queen at R2C8. The 20 cells marked × conflict with it by row, column, region or diagonal adjacency.
Board after step 1; earlier deductions are already applied.
1 cells
R2C821 cells
R1C7, R1C8, R1C9, R2C1, R2C2, R2C3, R2C4, R2C5, R2C6, R2C7, R2C8, R2C9, R3C7, R3C8, R3C9, R4C8, R5C8, R6C8, R7C8, R8C8, R9C8Reveal answer
Queens #935 full solution
| Row | Column | Region |
|---|---|---|
| R1 | C1 | 1 |
| R2 | C8 | 7 |
| R3 | C5 | 6 |
| R4 | C7 | 3 |
| R5 | C4 | 2 |
| R6 | C2 | 5 |
| R7 | C6 | 8 |
| R8 | C3 | 9 |
| R9 | C9 | 4 |
How to solve LinkedIn Queens #935
Step-by-step walkthrough
The key insight
The opening deduction: Observe: region 7 has only one remaining candidate: R2C8.
Rule: every region needs exactly one Queen.
Therefore: place a Queen at R2C8. The 20 cells marked × conflict with it by row, column, region or diagonal adjacency.
Your solving route
- Steps 1–1: narrow the candidates until R2C8 is forced.
- Steps 2–18: use the confirmed Queens to eliminate conflicts, then repeat the deductions for the remaining regions.
Open each deduction to see the observation, rule and board changes.
Step 1 · Only candidate
Observe: region 7 has only one remaining candidate: R2C8.
Rule: every region needs exactly one Queen.
Therefore: place a Queen at R2C8. The 20 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R2C821 cells
R1C7, R1C8, R1C9, R2C1, R2C2, R2C3, R2C4, R2C5, R2C6, R2C7, R2C8, R2C9, R3C7, R3C8, R3C9, R4C8, R5C8, R6C8, R7C8, R8C8, R9C8Step 2 · Locked candidates
Observe: region 3 has 2 remaining candidates: R4C7, R5C7. All lie in column 7.
Rule: region 3 needs one Queen, so it will occupy column 7. column 7 can contain no second Queen outside region 3.
Therefore: mark R6C7, R7C7, R8C7, R9C7 ×.
2 cells
R4C7, R5C74 cells
R6C7, R7C7, R8C7, R9C7Step 3 · Locked candidates
Observe: region 6 has 2 remaining candidates: R3C5, R4C5. All lie in column 5.
Rule: region 6 needs one Queen, so it will occupy column 5. column 5 can contain no second Queen outside region 6.
Therefore: mark R1C5, R5C5, R6C5, R7C5, R8C5, R9C5 ×.
2 cells
R3C5, R4C56 cells
R1C5, R5C5, R6C5, R7C5, R8C5, R9C5Step 4 · Locked candidates
Observe: row 9 has 6 remaining candidates: R9C1, R9C2, R9C3, R9C4, R9C6, R9C9. All lie in region 4.
Rule: row 9 needs one Queen, so it will occupy region 4. region 4 can contain no second Queen outside row 9.
Therefore: mark 11 cells (see details) ×.
View 11 coordinate references
Therefore: mark R3C1, R4C1, R4C9, R5C1, R5C9, R6C1, R6C9, R7C1, R7C9, R8C1, R8C9 ×.
6 cells
R9C1, R9C2, R9C3, R9C4, R9C6, R9C911 cells
R3C1, R4C1, R4C9, R5C1, R5C9, R6C1, R6C9, R7C1, R7C9, R8C1, R8C9Step 5 · Only candidate
Observe: column 9 has only one remaining candidate: R9C9.
Rule: every column needs exactly one Queen.
Therefore: place a Queen at R9C9. The 5 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R9C96 cells
R9C1, R9C2, R9C3, R9C4, R9C6, R9C9Step 6 · Only candidate
Observe: column 1 has only one remaining candidate: R1C1.
Rule: every column needs exactly one Queen.
Therefore: place a Queen at R1C1. The 7 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R1C18 cells
R1C1, R1C2, R1C3, R1C4, R1C6, R3C2, R4C2, R5C2Step 7 · Locked candidates
Observe: row 8 has 4 remaining candidates: R8C2, R8C3, R8C4, R8C6. All lie in region 9.
Rule: row 8 needs one Queen, so it will occupy region 9. region 9 can contain no second Queen outside row 8.
Therefore: mark R7C3, R7C4 ×.
4 cells
R8C2, R8C3, R8C4, R8C62 cells
R7C3, R7C4Step 8 · Common exclusions
Observe: row 3 must contain one Queen, chosen from R3C3, R3C4, R3C5, R3C6.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C4 conflicts with R3C3, R3C5 through diagonally adjacent cells; with R3C4 through the same column (column 4); with R3C6 through the same region (region 2).
Therefore: mark R4C4 ×. Every possible Queen in row 3 rules out these cells.
4 cells
R3C3, R3C4, R3C5, R3C61 cells
R4C4Step 9 · Common exclusions
Observe: column 3 must contain one Queen, chosen from R3C3, R4C3, R5C3, R6C3, R8C3.
Rule: Queens cannot share a row, column or region, or touch diagonally. R7C2 conflicts with R3C3, R4C3, R5C3, R6C3 through the same region (region 5); with R8C3 through diagonally adjacent cells.
Therefore: mark R7C2 ×. Every possible Queen in column 3 rules out these cells.
5 cells
R3C3, R4C3, R5C3, R6C3, R8C31 cells
R7C2Step 10 · Only candidate
Observe: row 7 has only one remaining candidate: R7C6.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R7C6. The 6 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R7C67 cells
R3C6, R4C6, R5C6, R6C4, R6C6, R7C6, R8C6Step 11 · Locked candidates
Observe: region 2 has 2 remaining candidates: R3C4, R5C4. All lie in column 4.
Rule: region 2 needs one Queen, so it will occupy column 4. column 4 can contain no second Queen outside region 2.
Therefore: mark R8C4 ×.
2 cells
R3C4, R5C41 cells
R8C4Step 12 · Locked candidates
Observe: row 6 has 2 remaining candidates: R6C2, R6C3. All lie in region 5.
Rule: row 6 needs one Queen, so it will occupy region 5. region 5 can contain no second Queen outside row 6.
Therefore: mark R3C3, R4C3, R5C3 ×.
2 cells
R6C2, R6C33 cells
R3C3, R4C3, R5C3Step 13 · Common exclusions
Observe: row 3 must contain one Queen, chosen from R3C4, R3C5.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C5 conflicts with R3C4 through diagonally adjacent cells; with R3C5 through the same column (column 5).
Therefore: mark R4C5 ×. Every possible Queen in row 3 rules out these cells.
2 cells
R3C4, R3C51 cells
R4C5Step 14 · Only candidate
Observe: row 4 has only one remaining candidate: R4C7.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R4C7. The 1 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R4C72 cells
R4C7, R5C7Step 15 · Only candidate
Observe: row 5 has only one remaining candidate: R5C4.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R5C4. The 2 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R5C43 cells
R3C4, R5C4, R6C3Step 16 · Only candidate
Observe: row 3 has only one remaining candidate: R3C5.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R3C5. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R3C51 cells
R3C5Step 17 · Only candidate
Observe: row 6 has only one remaining candidate: R6C2.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R6C2. The 1 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R6C22 cells
R6C2, R8C2Step 18 · Only candidate
Observe: row 8 has only one remaining candidate: R8C3.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R8C3. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R8C31 cells
R8C3A tempting mistake
A Queen at R1C2 looks possible before deductions. All 3 terminal branches run out of candidates in region 5, region 2. Rule out this tempting assumption.
Check every branch
The only candidate in region 7 forces R2C8.
Try R4C7.
The only candidate in region 6 forces R3C5.
The only candidate in region 2 forces R5C4.
Region 5 has no possible Queen: contradiction.
Try R5C7.
Try R3C5.
Region 2 has no possible Queen: contradiction.
Try R4C5.
Region 2 has no possible Queen: contradiction.