Skip to content
VEYRAPLAY
English
Sudoku
TechniquesExpert

Empty Rectangle

Learn how an Empty Rectangle turns a candidate restricted to one row and one column inside a box into a short single-digit chain that can produce precise eliminations.

Learn SudokuSudoku game

An Empty Rectangle is a single-digit Sudoku technique built from two pieces of candidate logic:

  1. inside one 3×3 box, all candidates for one digit are restricted to one row and one column;
  2. an external conjugate pair for that same digit connects to one side of the box pattern.

Together, those relationships create a short inference chain.

A candidate that sees both ends of that chain can be eliminated.

The important idea is not that the box literally contains an empty rectangle shape. The important idea is that the candidate positions inside the box are restricted to an L-shaped row/column framework.

Inside the box, the digit must occur on the ER row or on the ER column. An external strong link can turn that either/or relationship into an elimination.

Empty Rectangle belongs to the same broad single-digit world as Skyscraper, Two-String Kite, Turbot Fish, X-Chains and some Finned Fish descriptions.

Quick rule

For one candidate digit X:

  1. find a box where every X candidate lies on one row or one column of that box;
  2. treat the row-side and column-side candidate groups as an either/or relationship;
  3. connect one side to an external conjugate pair for X;
  4. identify the far endpoint of that conjugate pair;
  5. eliminate X from any target that is forced false by both ends of the resulting chain.

If you cannot explain the elimination as a valid inference chain, do not make it just because the candidate map looks rectangular.

What does “Empty Rectangle” mean?

The name refers to the cells in the box that are not occupied by the row-and-column candidate framework.

Suppose candidate 6 inside a box is restricted to:

  • several cells on row 5;
  • and several cells on column 4.

No candidate 6 appears in the rest of that box.

The unused cells form the visual “empty rectangle” region.

For solving, however, those empty cells are not the logical object that matters most.

The useful fact is:

Every possible 6 in the box belongs to either the selected row-side group or the selected column-side group.

That creates a grouped strong relationship between the two sides.

Why the box creates an either/or relationship

A Sudoku box must contain the candidate digit exactly once.

If all legal positions for X inside the box lie on the union of:

  • row R;
  • column C;

then at least one of those two sides must contain the eventual X.

Think of the box as providing two candidate groups:

  • R-side: X candidates in the ER row inside the box;
  • C-side: X candidates in the ER column inside the box.

They cannot both be completely false, because the box still needs X.

That is the foundation of the technique.

The groups do not need to be single cells. This is one reason Empty Rectangle is a useful bridge from ordinary conjugate-pair logic toward grouped links and Grouped AICs.

Add an external conjugate pair

The box relationship alone usually does not eliminate anything.

You need another strong relationship for the same candidate digit.

A conjugate pair means that within one row, column, or box, X has exactly two legal positions.

If one endpoint of that external pair interacts with one side of the Empty Rectangle, the chain can be extended to another endpoint outside the box.

The resulting logic is roughly:

ER side A =X= ER side B -X- conjugate endpoint 1 =X= conjugate endpoint 2

The exact notation varies because one ER side may be a group rather than a single candidate.

What matters is that the inference alternates correctly.

The two-case proof

A practical way to verify an Empty Rectangle is to reason by two cases.

Assume we have an ER for candidate X and an external conjugate pair.

Case 1: X is placed on the first ER side

That placement directly removes X from candidates that see that side.

Case 2: X is not placed on that ER side

Because the box must still contain X, the other ER side becomes true.

That forces the connected conjugate pair to its opposite endpoint.

The far endpoint then removes X from candidates that see it.

If the same target is eliminated in both cases, the target is impossible.

That is the reusable proof.

Step-by-step Empty Rectangle example

Empty Rectangle as a short X-Chain

Empty Rectangle is not isolated magic.

The pattern can be expressed as an X-Chain or a grouped alternating-inference chain for one candidate digit.

That perspective is useful because it replaces a memorized picture with standard logic:

  • strong inference from the restricted box;
  • weak interaction between candidates that see each other;
  • strong inference from the conjugate pair;
  • elimination from a target that sees both endpoints.

If you already understand X-Chains, an Empty Rectangle can often be recognized as a particularly compact candidate geometry.

Empty Rectangle vs Two-String Kite

Both techniques:

  • use one candidate digit;
  • combine strong relationships;
  • often produce one focused elimination;
  • can be represented as short chains.

A Two-String Kite is normally identified from:

  • one row conjugate pair;
  • one column conjugate pair;
  • one endpoint from each pair interacting through the same box.

An Empty Rectangle starts from a different box structure:

  • candidate X is restricted to one row and one column inside the box;
  • that grouped box relationship combines with an external conjugate pair.

The final inference may look similar, but the structure you search for is different.

Empty Rectangle vs Skyscraper

A Skyscraper normally uses two row-based or two column-based strong-link-like pairs with aligned bases and two roof candidates.

Empty Rectangle instead uses:

  • a box-based row/column restriction;
  • plus an external conjugate pair.

Both can often be translated into short X-Chains.

That is why learning the underlying link logic is more reliable than memorizing silhouettes.

Empty Rectangle vs Turbot Fish

Turbot Fish is a broader name commonly used for short single-digit chains built from two strong links connected by a weak link.

Skyscraper, Two-String Kite and some Empty Rectangle eliminations can all be understood inside that broader inference framework.

So:

  • Turbot Fish describes a general short-chain family;
  • Empty Rectangle describes a specific box-centered geometry.

VeyraPlay treats Empty Rectangle as its own Guide because the box restriction is distinctive and useful to search for directly.

Empty Rectangle vs Finned X-Wing

Some Empty Rectangle patterns can also be represented through more advanced Fish language, including Finned or Mutant Fish interpretations.

That does not make the techniques interchangeable for learning purposes.

For Empty Rectangle, the easiest human proof is usually:

restricted box → strong relationship → external conjugate pair → common target.

For Finned X-Wing, the easiest proof is usually:

basic Fish if fins are false → direct peer conflict if fins are true → intersection of elimination sets.

Choose the representation that makes the inference easiest to verify.

What is a Dual Empty Rectangle?

A Dual Empty Rectangle occurs when the candidate geometry supports the Empty Rectangle inference in both directions.

In other words, two strong relationships can exchange roles and produce two related eliminations from the same structure.

It is an extension of the same logic, not a separate foundation.

For the current VeyraPlay architecture, Dual Empty Rectangle belongs inside this Guide rather than needing its own URL.

How to find Empty Rectangles efficiently

Do not scan every box for an abstract rectangle.

Use a candidate-first workflow.

1. Choose one candidate digit

Empty Rectangle is a single-digit pattern.

Temporarily ignore every other candidate.

2. Inspect each box

Look for boxes where every remaining copy of X lies on:

  • one row;
  • one column;
  • or the union of one row and one column.

You want a clear row/column restriction.

3. Identify the two ER sides

Separate the candidate positions into:

  • row-side candidates;
  • column-side candidates.

Confirm that there is no candidate for X elsewhere in the box.

4. Search outward for a conjugate pair

Follow the ER row or column outside the box.

Look for a row/column where X has exactly two legal positions.

5. Test the far endpoint

Ask which candidates see:

  • the relevant ER endpoint or group;
  • and the far endpoint of the conjugate pair.

Only a candidate eliminated by the complete chain is a valid target.

6. Re-scan after the elimination

As with most advanced techniques, the useful result may be only one candidate deletion.

That deletion can immediately create:

  • a Single;
  • Locked Candidates;
  • a subset;
  • another conjugate pair.

Return to simpler logic first.

Common Empty Rectangle mistakes

Mistake 1: the box has candidates outside the chosen row and column

Then the ER strong relationship does not exist.

Every candidate for the digit inside the box must be covered by the selected row/column framework.

Mistake 2: treating any pair as a conjugate pair

A conjugate pair requires exactly two legal positions for that digit in the relevant house.

Two highlighted candidates are not automatically strongly linked.

Mistake 3: eliminating every candidate near the pattern

The elimination target must follow from the full inference chain.

Geometric proximity is not proof.

Mistake 4: assuming every ER must have the same orientation

The structure can be rotated or reflected:

  • row-side first or column-side first;
  • boxes anywhere in the grid;
  • external conjugate pair horizontal or vertical.

Search for relationships, not a fixed drawing.

Mistake 5: rejecting grouped ERs because one side has multiple candidates

The row-side or column-side of the ER can contain more than one candidate.

The important fact is that the box forces X into one side or the other.

When should you look for Empty Rectangle?

Empty Rectangle is most useful after ordinary single-digit techniques have stopped producing progress.

A sensible order is:

  1. Singles and Locked Candidates;
  2. subsets;
  3. X-Wing/Swordfish where appropriate;
  4. Skyscraper and Two-String Kite;
  5. Empty Rectangle;
  6. longer X-Chains or more general AIC logic.

That is not a universal difficulty ladder, but it is a practical recognition progression.

FAQ

Is Empty Rectangle a Fish technique?

It can be represented using advanced Fish language, but human solvers usually learn it as a short single-digit chain built from a restricted box and a conjugate pair.

Is Empty Rectangle an X-Chain?

The elimination can be expressed as an X-Chain or grouped single-digit inference chain. Empty Rectangle is the recognizable geometry that lets you spot that chain quickly.

Does the rectangle itself need to contain no candidates?

The name is historical shorthand for the geometry created by the row/column restriction inside the box. The logical requirement is that all candidates for the chosen digit in that box are confined to the selected row and column.

Can an Empty Rectangle use more than one candidate on one side?

Yes. One or both ER sides can act as grouped candidate nodes. The box-level either/or inference is what matters.

Is Dual Empty Rectangle a different technique?

It is an extension of the same pattern in which the structure supports eliminations in both directions. It does not require a separate foundational rule.

What to learn next

If Empty Rectangle makes sense as a chain rather than a picture, continue with X-Chain and Alternating Inference Chains. Those Guides generalize the same strong/weak inference language beyond this specific geometry.