LinkedIn Queens #911 Answer & Hints – October 28, 2026
Independent walkthrough by Queens Gamers · · 7×7 · Play on LinkedIn
LinkedIn Queens hints and the full solution for puzzle #911 on October 28, 2026. Follow 16 verified deductions on this 7×7 board, starting with region 4 in row 1.
Region 1 (6 cells) · Region 2 (23 cells) · Region 3 (8 cells) · Region 4 (2 cells) · Region 5 (2 cells) · Region 6 (4 cells) · Region 7 (4 cells)
LinkedIn Queens #911 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 R1C6, R1C7. 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
R1C6, R1C7Hint 2
Observe: region 4 has 2 remaining candidates: R1C6, R1C7. All lie in row 1.
Rule: region 4 needs one Queen, so it will occupy row 1. row 1 can contain no second Queen outside region 4.
Therefore: mark R1C1, R1C2, R1C3, R1C4, R1C5 ×.
Board after step 1; earlier deductions are already applied.
2 cells
R1C6, R1C75 cells
R1C1, R1C2, R1C3, R1C4, R1C5Hint 3
Step 1: Observe: region 4 has 2 remaining candidates: R1C6, R1C7. All lie in row 1.
Rule: region 4 needs one Queen, so it will occupy row 1. row 1 can contain no second Queen outside region 4.
Therefore: mark R1C1, R1C2, R1C3, R1C4, R1C5 ×.
Step 2: Observe: region 5 has 2 remaining candidates: R3C6, R3C7. All lie in row 3.
Rule: region 5 needs one Queen, so it will occupy row 3. row 3 can contain no second Queen outside region 5.
Therefore: mark R3C1, R3C2, R3C3, R3C4, R3C5 ×.
Step 3: Observe: region 1 has 2 remaining candidates: R2C1, R2C2. All lie in row 2.
Rule: region 1 needs one Queen, so it will occupy row 2. row 2 can contain no second Queen outside region 1.
Therefore: mark R2C3, R2C4, R2C5, R2C6, R2C7 ×.
Step 4: Observe: region 3 has 3 remaining candidates: R4C5, R4C6, R4C7. All lie in row 4.
Rule: region 3 needs one Queen, so it will occupy row 4. row 4 can contain no second Queen outside region 3.
Therefore: mark R4C1, R4C2, R4C3, R4C4 ×.
Step 5: Observe: row 7 has 7 remaining candidates: 7 cells (see details). All lie in region 2.
View 7 coordinate references
Step 5: Observe: row 7 has 7 remaining candidates: R7C1, R7C2, R7C3, R7C4, R7C5, R7C6, R7C7. All lie in region 2.
Rule: row 7 needs one Queen, so it will occupy region 2. region 2 can contain no second Queen outside row 7.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R5C4, R5C5, R5C6, R5C7, R6C5, R6C6, R6C7 ×.
Step 6: Observe: row 3 must contain one Queen, chosen from R3C6, R3C7.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C6 conflicts with R3C6 through the same column (column 6); with R3C7 through diagonally adjacent cells. R4C7 conflicts with R3C6 through diagonally adjacent cells; with R3C7 through the same column (column 7).
Therefore: mark R4C6, R4C7 ×. Every possible Queen in row 3 rules out these cells.
Step 7: Observe: row 4 has only one remaining candidate: R4C5.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R4C5. The 2 cells marked × conflict with it by row, column, region or diagonal adjacency.
Board after step 7; earlier deductions are already applied.
1 cells
R4C53 cells
R3C6, R4C5, R7C5Reveal answer
Queens #911 full solution
| Row | Column | Region |
|---|---|---|
| R1 | C6 | 4 |
| R2 | C2 | 1 |
| R3 | C7 | 5 |
| R4 | C5 | 3 |
| R5 | C3 | 7 |
| R6 | C1 | 6 |
| R7 | C4 | 2 |
How to solve LinkedIn Queens #911
Step-by-step walkthrough
The key insight
The opening deduction: Observe: region 4 has 2 remaining candidates: R1C6, R1C7. All lie in row 1.
Rule: region 4 needs one Queen, so it will occupy row 1. row 1 can contain no second Queen outside region 4.
Therefore: mark R1C1, R1C2, R1C3, R1C4, R1C5 ×.
Your solving route
- Steps 1–7: narrow the candidates until R4C5 is forced.
- Steps 8–16: 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: R1C6, R1C7. All lie in row 1.
Rule: region 4 needs one Queen, so it will occupy row 1. row 1 can contain no second Queen outside region 4.
Therefore: mark R1C1, R1C2, R1C3, R1C4, R1C5 ×.
2 cells
R1C6, R1C75 cells
R1C1, R1C2, R1C3, R1C4, R1C5Step 2 · Locked candidates
Observe: region 5 has 2 remaining candidates: R3C6, R3C7. All lie in row 3.
Rule: region 5 needs one Queen, so it will occupy row 3. row 3 can contain no second Queen outside region 5.
Therefore: mark R3C1, R3C2, R3C3, R3C4, R3C5 ×.
2 cells
R3C6, R3C75 cells
R3C1, R3C2, R3C3, R3C4, R3C5Step 3 · Locked candidates
Observe: region 1 has 2 remaining candidates: R2C1, R2C2. All lie in row 2.
Rule: region 1 needs one Queen, so it will occupy row 2. row 2 can contain no second Queen outside region 1.
Therefore: mark R2C3, R2C4, R2C5, R2C6, R2C7 ×.
2 cells
R2C1, R2C25 cells
R2C3, R2C4, R2C5, R2C6, R2C7Step 4 · Locked candidates
Observe: region 3 has 3 remaining candidates: R4C5, R4C6, R4C7. All lie in row 4.
Rule: region 3 needs one Queen, so it will occupy row 4. row 4 can contain no second Queen outside region 3.
Therefore: mark R4C1, R4C2, R4C3, R4C4 ×.
3 cells
R4C5, R4C6, R4C74 cells
R4C1, R4C2, R4C3, R4C4Step 5 · Locked candidates
Observe: row 7 has 7 remaining candidates: 7 cells (see details). All lie in region 2.
View 7 coordinate references
Observe: row 7 has 7 remaining candidates: R7C1, R7C2, R7C3, R7C4, R7C5, R7C6, R7C7. All lie in region 2.
Rule: row 7 needs one Queen, so it will occupy region 2. region 2 can contain no second Queen outside row 7.
Therefore: mark 7 cells (see details) ×.
View 7 coordinate references
Therefore: mark R5C4, R5C5, R5C6, R5C7, R6C5, R6C6, R6C7 ×.
7 cells
R7C1, R7C2, R7C3, R7C4, R7C5, R7C6, R7C77 cells
R5C4, R5C5, R5C6, R5C7, R6C5, R6C6, R6C7Step 6 · Common exclusions
Observe: row 3 must contain one Queen, chosen from R3C6, R3C7.
Rule: Queens cannot share a row, column or region, or touch diagonally. R4C6 conflicts with R3C6 through the same column (column 6); with R3C7 through diagonally adjacent cells. R4C7 conflicts with R3C6 through diagonally adjacent cells; with R3C7 through the same column (column 7).
Therefore: mark R4C6, R4C7 ×. Every possible Queen in row 3 rules out these cells.
2 cells
R3C6, R3C72 cells
R4C6, R4C7Step 7 · Only candidate
Observe: row 4 has only one remaining candidate: R4C5.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R4C5. The 2 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R4C53 cells
R3C6, R4C5, R7C5Step 8 · Only candidate
Observe: row 3 has only one remaining candidate: R3C7.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R3C7. The 2 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R3C73 cells
R1C7, R3C7, R7C7Step 9 · Only candidate
Observe: row 1 has only one remaining candidate: R1C6.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R1C6. The 1 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R1C62 cells
R1C6, R7C6Step 10 · Common exclusions
Observe: row 5 must contain one Queen, chosen from R5C1, R5C2, R5C3.
Rule: Queens cannot share a row, column or region, or touch diagonally. R6C2 conflicts with R5C1 through the same region (region 6); with R5C2 through the same column (column 2); with R5C3 through diagonally adjacent cells.
Therefore: mark R6C2 ×. Every possible Queen in row 5 rules out these cells.
3 cells
R5C1, R5C2, R5C31 cells
R6C2Step 11 · Locked candidates
Observe: region 6 has 2 remaining candidates: R5C1, R6C1. All lie in column 1.
Rule: region 6 needs one Queen, so it will occupy column 1. column 1 can contain no second Queen outside region 6.
Therefore: mark R2C1, R7C1 ×.
2 cells
R5C1, R6C12 cells
R2C1, R7C1Step 12 · Only candidate
Observe: row 2 has only one remaining candidate: R2C2.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R2C2. The 2 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R2C23 cells
R2C2, R5C2, R7C2Step 13 · Common exclusions
Observe: row 7 must contain one Queen, chosen from R7C3, R7C4.
Rule: Queens cannot share a row, column or region, or touch diagonally. R6C3 conflicts with R7C3 through the same column (column 3); with R7C4 through diagonally adjacent cells. R6C4 conflicts with R7C3 through diagonally adjacent cells; with R7C4 through the same column (column 4).
Therefore: mark R6C3, R6C4 ×. Every possible Queen in row 7 rules out these cells.
2 cells
R7C3, R7C42 cells
R6C3, R6C4Step 14 · Only candidate
Observe: row 6 has only one remaining candidate: R6C1.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R6C1. The 1 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R6C12 cells
R5C1, R6C1Step 15 · 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 1 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R5C32 cells
R5C3, R7C3Step 16 · Only candidate
Observe: row 7 has only one remaining candidate: R7C4.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R7C4. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R7C41 cells
R7C4A tempting mistake
A Queen at R1C1 looks possible before deductions. Following the forced placements leaves region 4 without a possible Queen. Rule out this tempting assumption.
Check every branch
Region 4 has no possible Queen: contradiction.