LinkedIn Queens #898 Answer & Hints – October 15, 2026
Independent walkthrough by Queens Gamers · · 8×8 · Play on LinkedIn
LinkedIn Queens hints and the full solution for puzzle #898 on October 15, 2026. Follow 17 verified deductions on this 8×8 board, starting with region 8 in row 7.
Region 1 (29 cells) · Region 2 (8 cells) · Region 3 (3 cells) · Region 4 (3 cells) · Region 5 (8 cells) · Region 6 (7 cells) · Region 7 (4 cells) · Region 8 (2 cells)
LinkedIn Queens #898 hints
Open one hint at a time. Reveal the full answer only when you are ready.
Hint 1
Start with region 8. Its candidates are R7C3, R7C4. 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
R7C3, R7C4Hint 2
Observe: region 8 has 2 remaining candidates: R7C3, R7C4. All lie in row 7.
Rule: region 8 needs one Queen, so it will occupy row 7. row 7 can contain no second Queen outside region 8.
Therefore: mark R7C1, R7C2, R7C5, R7C6, R7C7, R7C8 ×.
Board after step 1; earlier deductions are already applied.
2 cells
R7C3, R7C46 cells
R7C1, R7C2, R7C5, R7C6, R7C7, R7C8Hint 3
Step 1: Observe: region 8 has 2 remaining candidates: R7C3, R7C4. All lie in row 7.
Rule: region 8 needs one Queen, so it will occupy row 7. row 7 can contain no second Queen outside region 8.
Therefore: mark R7C1, R7C2, R7C5, R7C6, R7C7, R7C8 ×.
Step 2: Observe: region 3 has 3 remaining candidates: R2C5, 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 R2C1, R2C2, R2C3, R2C4, R2C8 ×.
Step 3: Observe: region 4 has 3 remaining candidates: R3C5, R3C6, R3C7. 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 R3C1, R3C2, R3C3, R3C4, R3C8 ×.
Step 4: Observe: region 2 has 2 remaining candidates: R4C2, R4C3. All lie in row 4.
Rule: region 2 needs one Queen, so it will occupy row 4. row 4 can contain no second Queen outside region 2.
Therefore: mark R4C1, R4C4, R4C5, R4C6, R4C7, R4C8 ×.
Step 5: Observe: region 7 has 3 remaining candidates: R6C2, R6C3, R6C4. All lie in row 6.
Rule: region 7 needs one Queen, so it will occupy row 6. row 6 can contain no second Queen outside region 7.
Therefore: mark R6C1, R6C5, R6C6, R6C7, R6C8 ×.
Step 6: Observe: region 5 has 2 remaining candidates: R5C6, R5C7. All lie in row 5.
Rule: region 5 needs one Queen, so it will occupy row 5. row 5 can contain no second Queen outside region 5.
Therefore: mark R5C1, R5C2, R5C3, R5C4, R5C5, R5C8 ×.
Step 7: Observe: region 6 has 5 remaining candidates: R8C1, R8C2, R8C3, R8C4, R8C5. All lie in row 8.
Rule: region 6 needs one Queen, so it will occupy row 8. row 8 can contain no second Queen outside region 6.
Therefore: mark R8C6, R8C7, R8C8 ×.
Step 8: Observe: column 8 has only one remaining candidate: R1C8.
Rule: every column needs exactly one Queen.
Therefore: place a Queen at R1C8. The 8 cells marked × conflict with it by row, column, region or diagonal adjacency.
Board after step 8; earlier deductions are already applied.
1 cells
R1C89 cells
R1C1, R1C2, R1C3, R1C4, R1C5, R1C6, R1C7, R1C8, R2C7Reveal answer
Queens #898 full solution
| Row | Column | Region |
|---|---|---|
| R1 | C8 | 1 |
| R2 | C5 | 3 |
| R3 | C7 | 4 |
| R4 | C3 | 2 |
| R5 | C6 | 5 |
| R6 | C2 | 7 |
| R7 | C4 | 8 |
| R8 | C1 | 6 |
How to solve LinkedIn Queens #898
Step-by-step walkthrough
The key insight
The opening deduction: Observe: region 8 has 2 remaining candidates: R7C3, R7C4. All lie in row 7.
Rule: region 8 needs one Queen, so it will occupy row 7. row 7 can contain no second Queen outside region 8.
Therefore: mark R7C1, R7C2, R7C5, R7C6, R7C7, R7C8 ×.
Your solving route
- Steps 1–8: narrow the candidates until R1C8 is forced.
- Steps 9–17: 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 8 has 2 remaining candidates: R7C3, R7C4. All lie in row 7.
Rule: region 8 needs one Queen, so it will occupy row 7. row 7 can contain no second Queen outside region 8.
Therefore: mark R7C1, R7C2, R7C5, R7C6, R7C7, R7C8 ×.
2 cells
R7C3, R7C46 cells
R7C1, R7C2, R7C5, R7C6, R7C7, R7C8Step 2 · Locked candidates
Observe: region 3 has 3 remaining candidates: R2C5, 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 R2C1, R2C2, R2C3, R2C4, R2C8 ×.
3 cells
R2C5, R2C6, R2C75 cells
R2C1, R2C2, R2C3, R2C4, R2C8Step 3 · Locked candidates
Observe: region 4 has 3 remaining candidates: R3C5, R3C6, R3C7. 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 R3C1, R3C2, R3C3, R3C4, R3C8 ×.
3 cells
R3C5, R3C6, R3C75 cells
R3C1, R3C2, R3C3, R3C4, R3C8Step 4 · Locked candidates
Observe: region 2 has 2 remaining candidates: R4C2, R4C3. All lie in row 4.
Rule: region 2 needs one Queen, so it will occupy row 4. row 4 can contain no second Queen outside region 2.
Therefore: mark R4C1, R4C4, R4C5, R4C6, R4C7, R4C8 ×.
2 cells
R4C2, R4C36 cells
R4C1, R4C4, R4C5, R4C6, R4C7, R4C8Step 5 · Locked candidates
Observe: region 7 has 3 remaining candidates: R6C2, R6C3, R6C4. All lie in row 6.
Rule: region 7 needs one Queen, so it will occupy row 6. row 6 can contain no second Queen outside region 7.
Therefore: mark R6C1, R6C5, R6C6, R6C7, R6C8 ×.
3 cells
R6C2, R6C3, R6C45 cells
R6C1, R6C5, R6C6, R6C7, R6C8Step 6 · Locked candidates
Observe: region 5 has 2 remaining candidates: R5C6, R5C7. All lie in row 5.
Rule: region 5 needs one Queen, so it will occupy row 5. row 5 can contain no second Queen outside region 5.
Therefore: mark R5C1, R5C2, R5C3, R5C4, R5C5, R5C8 ×.
2 cells
R5C6, R5C76 cells
R5C1, R5C2, R5C3, R5C4, R5C5, R5C8Step 7 · Locked candidates
Observe: region 6 has 5 remaining candidates: R8C1, R8C2, R8C3, R8C4, R8C5. All lie in row 8.
Rule: region 6 needs one Queen, so it will occupy row 8. row 8 can contain no second Queen outside region 6.
Therefore: mark R8C6, R8C7, R8C8 ×.
5 cells
R8C1, R8C2, R8C3, R8C4, R8C53 cells
R8C6, R8C7, R8C8Step 8 · Only candidate
Observe: column 8 has only one remaining candidate: R1C8.
Rule: every column needs exactly one Queen.
Therefore: place a Queen at R1C8. The 8 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R1C89 cells
R1C1, R1C2, R1C3, R1C4, R1C5, R1C6, R1C7, R1C8, R2C7Step 9 · Only candidate
Observe: column 1 has only one remaining candidate: R8C1.
Rule: every column needs exactly one Queen.
Therefore: place a Queen at R8C1. The 4 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R8C15 cells
R8C1, R8C2, R8C3, R8C4, R8C5Step 10 · Common exclusions
Observe: row 2 must contain one Queen, chosen from R2C5, R2C6.
Rule: Queens cannot share a row, column or region, or touch diagonally. R3C5 conflicts with R2C5 through the same column (column 5); with R2C6 through diagonally adjacent cells. R3C6 conflicts with R2C5 through diagonally adjacent cells; with R2C6 through the same column (column 6).
Therefore: mark R3C5, R3C6 ×. Every possible Queen in row 2 rules out these cells.
2 cells
R2C5, R2C62 cells
R3C5, R3C6Step 11 · 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
R2C6, R3C7, R5C7Step 12 · Only candidate
Observe: row 2 has only one remaining candidate: R2C5.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R2C5. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R2C51 cells
R2C5Step 13 · Only candidate
Observe: row 5 has only one remaining candidate: R5C6.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R5C6. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R5C61 cells
R5C6Step 14 · Common exclusions
Observe: row 6 must contain one Queen, chosen from R6C2, R6C3, R6C4.
Rule: Queens cannot share a row, column or region, or touch diagonally. R7C3 conflicts with R6C2, R6C4 through diagonally adjacent cells; with R6C3 through the same column (column 3).
Therefore: mark R7C3 ×. Every possible Queen in row 6 rules out these cells.
3 cells
R6C2, R6C3, R6C41 cells
R7C3Step 15 · 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 2 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R7C43 cells
R6C3, R6C4, R7C4Step 16 · 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
R4C2, R6C2Step 17 · Only candidate
Observe: row 4 has only one remaining candidate: R4C3.
Rule: every row needs exactly one Queen.
Therefore: place a Queen at R4C3. The 0 cells marked × conflict with it by row, column, region or diagonal adjacency.
1 cells
R4C31 cells
R4C3A tempting mistake
A Queen at R1C1 looks possible before deductions. Following the forced placements leaves column 8 without a possible Queen. Rule out this tempting assumption.
Check every branch
Column 8 has no possible Queen: contradiction.