How to Solve Queens: Complete Strategy Guide

Queens is a pure-logic placement puzzle: a grid split into coloured regions, and your job is to drop one crown into every row, every column, and every region — without any two crowns ever touching. No arithmetic, no guessing. Just constraint after constraint until the board resolves.

It looks sparse compared to Sudoku, but that sparseness is the point. Every crown you place erases a whole neighbourhood of possibilities, so a single deduction often cascades across the board. This guide walks through the ruleset and every core solving technique, with worked cell-by-cell examples.

How Queens Works

A Queens board is an N×N grid divided into N coloured regions. You place exactly N crowns, and they must obey four rules simultaneously:

1. One crown per row.
2. One crown per column.
3. One crown per coloured region.
4. No two crowns touch — not horizontally, not vertically, and not diagonally. Every crown must have empty cells in all eight surrounding squares.

Rules 1–3 are the same “exactly one per line” logic that Sudoku uses. Rule 4 — the adjacency rule — is what makes Queens distinct. A crown doesn’t just block its own row and column; it also blocks the (up to) eight cells immediately around it.

Because N crowns must spread across N rows, N columns, and N regions, the count is always tight: there is exactly one crown per line of each type. That tightness is your main weapon — anywhere the options shrink to one, you place a crown.

Puzzmint’s Queens (Crownflow) puzzles use this exact ruleset. If you’ve played the LinkedIn Queens-style daily, the mechanics transfer directly — the techniques below are genre-standard, not app-specific.

Strategy 1: Place Crowns in Line-Locked Regions

The fastest openings come from regions squeezed onto a single line.

If an entire region sits within one row, then that row’s crown must belong to that region — there’s nowhere else in the region to put it. The reverse is also true: no other region can claim that row. The same logic applies to a region trapped in a single column.

Example: Say region T occupies only two cells, both in row 4. You may not know which of the two is the crown yet, but you already know:

• Row 4’s crown is region T’s crown.
• Every cell of every other region that lies in row 4 is eliminated.

That single observation can free up an entire row for elimination before you’ve placed anything.

The strongest version — a single-cell region. If a region has been reduced to one open cell (its other cells eliminated by neighbouring crowns), place the crown there immediately. It satisfies its region, its row, and its column in one move.

Strategy 2: Squeeze Regions Onto Shared Lines

This is Queens’ equivalent of Sudoku’s pointing pairs, and it’s the technique that cracks most hard boards.

Track which columns (or rows) each region is still able to use. When a set of k regions can only occupy the same k columns between them, those k columns are fully consumed by that group — every other region is forbidden from those columns.

Why it works: each column holds exactly one crown. If two regions can only live in columns 3 and 4, those two crowns fill both columns. There’s no room left for a third region there. This often forces the remaining regions onto a much smaller set of cells — sometimes down to one.

Strategy 3: Eliminate With the Adjacency Rule

Every crown forbids its eight neighbours. Use this aggressively the moment a crown lands, and use it predictively even before you place.

After placing a crown, cross out:

• the rest of its row,
• the rest of its column,
• its whole region,
• and all eight touching cells.

Predictive use — the diagonal veto. Suppose you know row 1’s crown is at column 2 (region P), and you’re deciding where region O goes in row 2. Region O’s row-2 candidates are columns 3 and 4. Column 3 sits diagonally adjacent to the crown at row 1, column 2 (one row down, one column across) — so it is forbidden by rule 4. Region O in row 2 is therefore pinned to column 4. The adjacency rule resolved the cell without any counting.

Beginners consistently overlook the diagonal half of this rule. Train yourself to check all eight neighbours, not just the four orthogonal ones — it’s where most Queens deductions actually hide.

Strategy 4: Use Row and Column Exhaustion

Mirror Strategy 1, but from the line’s point of view instead of the region’s.

After a round of eliminations, scan every row and every column:

• A row with only one open cell → that cell is a crown.
• A column with only one open cell → that cell is a crown.

Each placement triggers another wave of adjacency and region eliminations, which often exposes the next single-candidate line. Queens solves in cascades: one crown clears space that makes the following crown obvious.

Strategy 5: Work in Passes

Queens rewards a systematic sweep over scattered guessing. Cycle through these passes:

Pass 1 — Line-locked regions. Find any region trapped in a single row or column (Strategy 1). Mark that line as owned; eliminate other regions’ cells there.

Pass 2 — Region squeezes. For each row and column, note which regions can still reach it. Apply the k-regions-in-k-lines squeeze (Strategy 2). Eliminate outsiders.

Pass 3 — Place forced crowns. Any region, row, or column now down to a single open cell gets a crown.

Pass 4 — Propagate adjacency. For every crown placed, clear its row, column, region, and all eight neighbours (Strategy 3).

Pass 5 — Repeat from Pass 2 until every crown is placed.

Small boards (5×5–7×7) usually fall in two or three cycles. Larger boards need more, but the loop never changes.

A Complete Mini-Solve

Here’s a full 4×4 board solved from start to finish. Four regions — P (purple-ish), O, G, T — one crown each.

Region map:

Step 1 — Line-locked region (Strategy 1). Region T occupies only R4C3 and R4C4, both in row 4. So row 4’s crown belongs to T. Every other region’s cell in row 4 is eliminated — that removes R4C1 and R4C2 from region G. G is now confined to {R2C2, R3C1, R3C2, R3C3}.

Step 2 — Column partition (Strategy 2). Look at where each region can still live by column:

• O occupies columns 3–4 only. T occupies columns 3–4 only.
• Two regions (O, T) can only use two columns (3, 4) → they consume both. P and G are pushed out of columns 3 and 4, so P and G must take columns 1 and 2.

Step 3 — Region squeeze on G. G’s surviving cells were {R2C2, R3C1, R3C2, R3C3}. Restricted to columns 1–2, that’s {R3C1 (col 1), R2C2 (col 2), R3C2 (col 2)}.

Step 4 — Rows force P’s crown. P’s cells are {R1C1, R1C2, R2C1}, in rows 1–2. G lives in rows 2–3, O in rows 1–3, T in row 4. Since rows 1, 2, 3 must be split among P, G, O, test P in row 1 vs row 2:

• If G takes R3C1 (row 3, col 1), then P must take column 2 → P = R1C2 (its only col-2 cell). That puts P in row 1, leaving row 2 for O.

Step 5 — Adjacency finishes it (Strategy 3). With P at R1C2, region O in row 2 chooses between R2C3 and R2C4. R2C3 is diagonally adjacent to the crown at R1C2 (down one, across one) → forbidden. So O = R2C4. That leaves column 3 for T = R4C3.

Step 6 — Verify. Crowns at R1C2, R2C4, R3C1, R4C3. Rows 1-2-3-4 ✓, columns 2-4-1-3 ✓, regions P-O-G-T ✓. Check touching: no two crowns are within one cell of each other in any direction. Solved.

(You can confirm this is the board’s only solution — every other branch collides with the diagonal-adjacency rule.)

Quick Reference: The Queens Checklist

Keep this beside you while solving.

1. Scan for line-locked regions — any region trapped in one row or column claims that line.
2. Track region reach per column and row — k regions confined to k lines consume all of them.
3. Place every forced crown — a region, row, or column with one open cell.
4. After each crown, clear 4 + 4 — the four orthogonal and four diagonal neighbours, plus the full row, column, and region.
5. Repeat until N crowns sit on the board.
6. Never guess — a well-formed Queens puzzle is always solvable by these eliminations alone.

Frequently Asked Questions

Q: Can two crowns be diagonally next to each other? No. Rule 4 forbids any two crowns from touching — orthogonally or diagonally. Each crown needs all eight surrounding cells empty. Forgetting the diagonal case is the single most common Queens mistake.

Q: How many crowns go on the board? Exactly N on an N×N grid — one per row, one per column, and one per coloured region. The three counts always match because there are always N regions.

Q: Do I ever need to guess in Queens? No. A properly constructed Queens puzzle has a unique solution reachable by pure logic. If you’re stuck, you’ve usually missed a diagonal adjacency or a region-to-line squeeze — not hit a genuine fork.

Q: What size are Queens boards? They scale with difficulty — commonly 7×7 to 9×9 for a daily, larger for expert grids. The techniques here work identically at every size; bigger boards just need more elimination passes.

Q: How is Queens different from the classic N-Queens chess problem? The classic N-Queens problem uses full chess-queen movement (a queen attacks along entire ranks, files, and diagonals) and has no coloured regions. Puzzle Queens replaces that with two constraints: crowns only block adjacent diagonal cells (not whole diagonals), and every coloured region must contain exactly one crown. That regional constraint is what turns it into a deduction puzzle rather than a placement search.

Q: Is Queens harder than Sudoku? It’s a different flavour. Queens has fewer symbols to track (crown or empty, versus nine digits) but the adjacency rule adds a spatial constraint Sudoku lacks. Most solvers find beginner Queens quicker to learn and hard Queens comparably tricky to hard Sudoku.

What to Try Next

• How to Solve Sudoku: Complete Guide — Queens shares Sudoku’s “exactly one per line” backbone. The single-candidate scan transfers directly to Queens’ row and column exhaustion.
• Naked Singles and Hidden Singles — the cleanest framing of “only one cell left” logic, which is exactly how Queens crowns get forced.
• Logic Puzzle Deduction Chains — how to propagate one placement into the next, the core rhythm of a Queens solve.
• Daily Puzzle Habit: Why 10 Minutes Sharpens Your Brain — why a short daily Queens grid builds durable pattern recognition.

Puzzmint is a calm, ad-free daily logic puzzle hub. Try today’s Puzzle →