LinkedIn Queens #907 Answer & Hints – October 24, 2026
Independent walkthrough by Queens Gamers · · 9×9 · Play on LinkedIn
LinkedIn Queens hints and the full solution for puzzle #907 on October 24, 2026. Follow 20 verified deductions on this 9×9 board, starting with region 4 in row 3.
Region 1 (20 cells) · Region 2 (11 cells) · Region 3 (4 cells) · Region 4 (2 cells) · Region 5 (9 cells) · Region 6 (9 cells) · Region 7 (2 cells) · Region 8 (11 cells) · Region 9 (13 cells)
LinkedIn Queens #907 hints
Open one hint at a time. Reveal the full answer only when you are ready.
Hint 1
Start with region 4. Its candidates are R3C1, R3C2. Can you spot a shared row, column or region? Remember that each row, column and region needs exactly one Queen.
Starting board: no deductions applied yet.
2 cells
R3C1, R3C2Hint 2
Observe: region 4 has 2 remaining candidates: R3C1, R3C2. All lie in row 3.
Rule: region 4 needs one Queen, so it will occupy row 3. row 3 can contain no second Queen outside region 4.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R3C3, R3C4, R3C5, R3C6, R3C7, R3C8, R3C9 ×.
Board after step 1; earlier deductions are already applied.
2 cells
R3C1, R3C27 cells
R3C3, R3C4, R3C5, R3C6, R3C7, R3C8, R3C9Hint 3
Step 1: Observe: region 4 has 2 remaining candidates: R3C1, R3C2. All lie in row 3.
Rule: region 4 needs one Queen, so it will occupy row 3. row 3 can contain no second Queen outside region 4.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R3C3, R3C4, R3C5, R3C6, R3C7, R3C8, R3C9 ×.
Step 2: Observe: region 3 has 2 remaining candidates: R2C6, R2C7. All lie in row 2.
Rule: region 3 needs one Queen, so it will occupy row 2. row 2 can contain no second Queen outside region 3.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R2C1, R2C2, R2C3, R2C4, R2C5, R2C8, R2C9 ×.
Step 3: Observe: region 7 has 2 remaining candidates: R5C2, R5C3. All lie in row 5.
Rule: region 7 needs one Queen, so it will occupy row 5. row 5 can contain no second Queen outside region 7.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R5C1, R5C4, R5C5, R5C6, R5C7, R5C8, R5C9 ×.
Step 4: Observe: row 1 has 9 remaining candidates: 9 cells (see details). All lie in region 1.
View 9 coordinate references
Step 4: Observe: row 1 has 9 remaining candidates: R1C1, R1C2, R1C3, R1C4, R1C5, R1C6, R1C7, R1C8, R1C9. All lie in region 1.
Rule: row 1 needs one Queen, so it will occupy region 1. region 1 can contain no second Queen outside row 1.
Therefore: mark R4C5, R4C8, R4C9 ×.
Step 5: Observe: row 2 must contain one Queen, chosen from R2C6, R2C7.
Rule: Queens cannot share a row, column or region, or touch diagonally. R1C6 conflicts with R2C6 through the same column (column 6); with R2C7 through diagonally adjacent cells. R1C7 conflicts with R2C6 through diagonally adjacent cells; with R2C7 through the same column (column 7).
Therefore: mark R1C6, R1C7 ×. Every possible Queen in row 2 rules out these cells.
Step 6: Observe: row 3 must contain one Queen, chosen from R3C1, R3C2.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C1 conflicts with R3C1 through the same column (column 1); with R3C2 through diagonally adjacent cells. R4C2 conflicts with R3C1 through diagonally adjacent cells; with R3C2 through the same column (column 2).
Therefore: mark R4C1, R4C2 ×. Every possible Queen in row 3 rules out these cells.
Step 7: Observe: row 5 must contain one Queen, chosen from R5C2, R5C3.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3). R6C2 conflicts with R5C2 through the same column (column 2); with R5C3 through diagonally adjacent cells. R6C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3).
View 9 coordinate references
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3). R6C2 conflicts with R5C2 through the same column (column 2); with R5C3 through diagonally adjacent cells. R6C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3).
Therefore: mark R4C3, R6C2, R6C3 ×. Every possible Queen in row 5 rules out these cells.
Step 8: Observe: region 2 has only one remaining candidate: R6C1.
Rule: every region needs exactly one Queen.
Therefore: place a Queen at R6C1. The 13 cells marked × conflict with it by row, column, region or diagonal adjacency.
Board after step 8; earlier deductions are already applied.
1 cells
R6C114 cells
R1C1, R3C1, R5C2, R6C1, R6C4, R6C5, R6C6, R6C7, R6C8, R6C9, R7C1, R7C2, R8C1, R9C1Reveal answer
Queens #907 full solution
| Row | Column | Region |
|---|---|---|
| R1 | C5 | 1 |
| R2 | C7 | 3 |
| R3 | C2 | 4 |
| R4 | C6 | 5 |
| R5 | C3 | 7 |
| R6 | C1 | 2 |
| R7 | C9 | 6 |
| R8 | C4 | 9 |
| R9 | C8 | 8 |
How to solve LinkedIn Queens #907
Step-by-step walkthrough
The key insight
The opening deduction: Observe: region 4 has 2 remaining candidates: R3C1, R3C2. All lie in row 3.
Rule: region 4 needs one Queen, so it will occupy row 3. row 3 can contain no second Queen outside region 4.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R3C3, R3C4, R3C5, R3C6, R3C7, R3C8, R3C9 ×.
Your solving route
- Steps 1–8: narrow the candidates until R6C1 is forced.
- Steps 9–20: 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 · Locked candidates
Observe: region 4 has 2 remaining candidates: R3C1, R3C2. All lie in row 3.
Rule: region 4 needs one Queen, so it will occupy row 3. row 3 can contain no second Queen outside region 4.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R3C3, R3C4, R3C5, R3C6, R3C7, R3C8, R3C9 ×.
2 cells
R3C1, R3C27 cells
R3C3, R3C4, R3C5, R3C6, R3C7, R3C8, R3C9Step 2 · Locked candidates
Observe: region 3 has 2 remaining candidates: R2C6, R2C7. All lie in row 2.
Rule: region 3 needs one Queen, so it will occupy row 2. row 2 can contain no second Queen outside region 3.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R2C1, R2C2, R2C3, R2C4, R2C5, R2C8, R2C9 ×.
2 cells
R2C6, R2C77 cells
R2C1, R2C2, R2C3, R2C4, R2C5, R2C8, R2C9Step 3 · Locked candidates
Observe: region 7 has 2 remaining candidates: R5C2, R5C3. All lie in row 5.
Rule: region 7 needs one Queen, so it will occupy row 5. row 5 can contain no second Queen outside region 7.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R5C1, R5C4, R5C5, R5C6, R5C7, R5C8, R5C9 ×.
2 cells
R5C2, R5C37 cells
R5C1, R5C4, R5C5, R5C6, R5C7, R5C8, R5C9Step 4 · Locked candidates
Observe: row 1 has 9 remaining candidates: 9 cells (see details). All lie in region 1.
View 9 coordinate references
Observe: row 1 has 9 remaining candidates: R1C1, R1C2, R1C3, R1C4, R1C5, R1C6, R1C7, R1C8, R1C9. All lie in region 1.
Rule: row 1 needs one Queen, so it will occupy region 1. region 1 can contain no second Queen outside row 1.
Therefore: mark R4C5, R4C8, R4C9 ×.
9 cells
R1C1, R1C2, R1C3, R1C4, R1C5, R1C6, R1C7, R1C8, R1C93 cells
R4C5, R4C8, R4C9Step 5 · Common exclusions
Observe: row 2 must contain one Queen, chosen from R2C6, R2C7.
Rule: Queens cannot share a row, column or region, or touch diagonally. R1C6 conflicts with R2C6 through the same column (column 6); with R2C7 through diagonally adjacent cells. R1C7 conflicts with R2C6 through diagonally adjacent cells; with R2C7 through the same column (column 7).
Therefore: mark R1C6, R1C7 ×. Every possible Queen in row 2 rules out these cells.
2 cells
R2C6, R2C72 cells
R1C6, R1C7Step 6 · Common exclusions
Observe: row 3 must contain one Queen, chosen from R3C1, R3C2.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C1 conflicts with R3C1 through the same column (column 1); with R3C2 through diagonally adjacent cells. R4C2 conflicts with R3C1 through diagonally adjacent cells; with R3C2 through the same column (column 2).
Therefore: mark R4C1, R4C2 ×. Every possible Queen in row 3 rules out these cells.
2 cells
R3C1, R3C22 cells
R4C1, R4C2Step 7 · Common exclusions
Observe: row 5 must contain one Queen, chosen from R5C2, R5C3.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3). R6C2 conflicts with R5C2 through the same column (column 2); with R5C3 through diagonally adjacent cells. R6C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3).
View 9 coordinate references
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3). R6C2 conflicts with R5C2 through the same column (column 2); with R5C3 through diagonally adjacent cells. R6C3 conflicts with R5C2 through diagonally adjacent cells; with R5C3 through the same column (column 3).
Therefore: mark R4C3, R6C2, R6C3 ×. Every possible Queen in row 5 rules out these cells.
2 cells
R5C2, R5C33 cells
R4C3, R6C2, R6C3Step 8 · Only candidate
Observe: region 2 has only one remaining candidate: R6C1.
Rule: every region needs exactly one Queen.
Therefore: place a Queen at R6C1. The 13 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R6C114 cells
R1C1, R3C1, R5C2, R6C1, R6C4, R6C5, R6C6, R6C7, R6C8, R6C9, R7C1, R7C2, R8C1, R9C1Step 9 · Only candidate
Observe: row 3 has only one remaining candidate: R3C2.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R3C2. The 3 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R3C24 cells
R1C2, R3C2, R8C2, R9C2Step 10 · Only candidate
Observe: row 5 has only one remaining candidate: R5C3.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R5C3. The 5 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R5C36 cells
R1C3, R4C4, R5C3, R7C3, R8C3, R9C3Step 11 · Locked candidates
Observe: region 5 has 2 remaining candidates: R4C6, R7C6. All lie in column 6.
Rule: region 5 needs one Queen, so it will occupy column 6. column 6 can contain no second Queen outside region 5.
Therefore: mark R2C6, R8C6, R9C6 ×.
2 cells
R4C6, R7C63 cells
R2C6, R8C6, R9C6Step 12 · Only candidate
Observe: row 2 has only one remaining candidate: R2C7.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R2C7. The 5 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R2C76 cells
R1C8, R2C7, R4C7, R7C7, R8C7, R9C7Step 13 · Only candidate
Observe: row 4 has only one remaining candidate: R4C6.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R4C6. The 1 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R4C62 cells
R4C6, R7C6Step 14 · Locked candidates
Observe: region 6 has 2 remaining candidates: R7C9, R8C9. All lie in column 9.
Rule: region 6 needs one Queen, so it will occupy column 9. column 9 can contain no second Queen outside region 6.
Therefore: mark R1C9, R9C9 ×.
2 cells
R7C9, R8C92 cells
R1C9, R9C9Step 15 · Locked candidates
Observe: column 8 has 3 remaining candidates: R7C8, R8C8, R9C8. All lie in region 8.
Rule: column 8 needs one Queen, so it will occupy region 8. region 8 can contain no second Queen outside column 8.
Therefore: mark R7C5, R8C5 ×.
3 cells
R7C8, R8C8, R9C82 cells
R7C5, R8C5Step 16 · Common exclusions
Observe: column 8 must contain one Queen, chosen from R7C8, R8C8, R9C8.
Rule: Queens cannot share a row, column or region, or touch diagonally. R8C9 conflicts with R7C8, R9C8 through diagonally adjacent cells; with R8C8 through the same row (row 8).
Therefore: mark R8C9 ×. Every possible Queen in column 8 rules out these cells.
3 cells
R7C8, R8C8, R9C81 cells
R8C9Step 17 · Only candidate
Observe: column 9 has only one remaining candidate: R7C9.
Rule: every column needs exactly one Queen.
Therefore: place a Queen at R7C9. The 3 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R7C94 cells
R7C4, R7C8, R7C9, R8C8Step 18 · Only candidate
Observe: row 8 has only one remaining candidate: R8C4.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R8C4. The 3 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R8C44 cells
R1C4, R8C4, R9C4, R9C5Step 19 · Only candidate
Observe: row 1 has only one remaining candidate: R1C5.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R1C5. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R1C51 cells
R1C5Step 20 · Only candidate
Observe: row 9 has only one remaining candidate: R9C8.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R9C8. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R9C81 cells
R9C8A tempting mistake
A Queen at R1C1 looks possible before deductions. Following the forced placements leaves region 7 without a possible Queen. Rule out this tempting assumption.
Check every branch
The only candidate in region 4 forces R3C2.
The only candidate in region 2 forces R6C3.
Region 7 has no possible Queen: contradiction.