On this page
A Two-String Kite is a one-digit elimination pattern built from:
- one row Strong Link;
- one column Strong Link;
- one endpoint from each link connected inside the same 3×3 box.
Those two connecting candidates are distinct positions that see each other through the box, so they cannot both contain the digit.
The two endpoints outside the connecting box are the free ends of the kite.
At least one free end must contain the digit.
Therefore the digit can be removed from any candidate that sees both free ends.
Two-String Kite at a glance
For candidate X:
row string: free end R -------- box end A
\
shared box
/
column string: free end C -------- box end BThe row pair and column pair are the two “strings.”
One endpoint from each string lies in the same box, creating the Weak-Link connection needed for the proof.
- Row
- Column
- Box
- Free ends
- Eliminations
Why Two-String Kite works
Suppose candidate 5 appears exactly twice in one row:
- free end R;
- box end A.
And exactly twice in one column:
- free end C;
- box end B.
A and B are different candidate positions in the same 3×3 box.
Because they contain the same digit and see each other through the box, A and B cannot both be 5.
So at least one of them is false.
If A is false
The row Strong Link forces R = 5.
If B is false
The column Strong Link forces C = 5.
Therefore:
free end R is 5 or free end C is 5.
Any candidate 5 that sees both free ends is impossible.
Step-by-step board example
A reliable proof sequence is:
- filter one candidate digit;
- find a row containing exactly two positions for that digit;
- find a column containing exactly two positions for that digit;
- confirm one row endpoint and one column endpoint are distinct candidates in the same box;
- label the opposite endpoints as the free ends;
- prove that at least one free end must be true;
- eliminate the digit only from cells that see both free ends.
Why the box connection matters
The connecting endpoints need a Weak Link: they cannot both be true.
Sharing a 3×3 box supplies that exclusion because the same digit cannot appear twice in one box.
Without that relationship, both inside endpoints could be true simultaneously. If that happened, both free ends could be false, so the conclusion “at least one free end is true” would fail.
The box is therefore not decorative geometry.
It is the logical bridge between the two strings.
The connecting endpoints must be distinct
A common conceptual mistake is to imagine that the row Strong Link and column Strong Link can simply share the exact same candidate cell as their connection.
That does not produce the standard Two-String Kite proof described here.
If the same cell were the inside endpoint of both strings, that cell could itself be true, allowing both outer endpoints to be false. The required either/or relationship between the free ends would disappear.
For the standard Kite:
- the row box endpoint and column box endpoint are different cells;
- they see each other because they are in the same box.
This distinction makes the Weak Link explicit rather than relying on a vague picture of two lines crossing.
How to find a Two-String Kite
Two-String Kite is a digit-first technique.
1. Filter one digit
Ignore other candidates temporarily.
2. Mark row conjugate pairs
Find rows containing exactly two candidate positions for the digit.
3. Mark column conjugate pairs
Do the same for columns.
4. Compare endpoints inside each box
Can one endpoint from a row pair and one endpoint from a column pair lie in the same box?
They must be distinct cells.
5. Identify the two free ends
These are the endpoints outside the box connection.
6. Search for common peers of the free ends
Any candidate of the pattern digit that sees both free ends can be eliminated.
7. Verify both Strong Links and the box Weak Link
Do not rely on geometry alone.
Why the row and column need exactly two candidates
The row and column pairs are Strong Links.
If the chosen row contains three candidate positions for the digit, making the inside endpoint false does not force the outer endpoint true. A third candidate remains possible.
The same applies to the column.
So source-house completeness is essential:
- exactly two candidate positions in the row;
- exactly two candidate positions in the column.
This is the same Strong-Link discipline used later in X-Chains.
Two-String Kite vs Skyscraper
These patterns are closely related.
Both use:
- one digit;
- two Strong Links;
- a Weak Link joining one endpoint from each Strong Link;
- an elimination from candidates that see both opposite endpoints.
The difference is the source geometry.
Skyscraper
Uses two row Strong Links or two column Strong Links.
The connecting endpoints align in a column or row.
Two-String Kite
Uses one row Strong Link and one column Strong Link.
The connecting endpoints see each other through a box.
Once Strong/Weak Link language is familiar, the two techniques become variations of the same chain idea.
Two-String Kite vs X-Wing
An X-Wing is a size-2 Basic Fish:
- two base sets;
- two cover sets;
- same-digit candidates restricted to the Fish structure.
Two-String Kite is better understood as a short one-digit chain pattern using two Strong Links and a box connection.
Sparse same-digit candidates can make the diagrams look superficially related, but the proof frameworks differ.
Two-String Kite vs Turbot Fish
Two-String Kite is one of the classic named forms that can also be represented as a Turbot Fish or short X-Chain.
Turbot Fish is a broader four-candidate one-digit chain concept. Named patterns such as:
- Skyscraper;
- Two-String Kite;
- some Empty Rectangle structures;
capture recurring geometries that are easier for humans to recognize directly.
For this corpus, Two-String Kite remains the preferred name when the row + column + box structure is clear.
Two-String Kite vs Empty Rectangle
Both are one-digit chain patterns that make important use of box geometry.
A Two-String Kite has:
- one row conjugate pair;
- one column conjugate pair;
- two connecting endpoints in the same box.
An Empty Rectangle uses a different box candidate configuration combined with an external Strong Link.
The later Empty Rectangle expansion will treat that structure separately rather than collapsing every box-based short chain into the Kite label.
What is a Dual Two-String Kite?
Sometimes the same central box relationship supports two separate Two-String Kite deductions.
This is commonly called a Dual Two-String Kite.
It does not add fundamentally stronger logic: the result can be understood as two standard Kites found in the same candidate configuration.
For learning and manual solving, it is usually clearer to prove each ordinary Kite separately before treating the dual pattern as a compact combined observation.
A valid Kite can be unproductive
The row pair, column pair, and box connection may all be valid while no external candidate sees both free ends.
In that situation the pattern produces no elimination now.
Do not remove a digit merely because a Kite-shaped structure exists.
A productive move requires a target candidate in the intersection of the two free-end peer regions.
Common Two-String Kite mistakes
Using a row or column with more than two candidates
Then the required Strong Link is missing.
Using connecting endpoints in different boxes
They need a valid Weak-Link relationship. The standard pattern uses two distinct candidates in the same box.
Treating the same cell as both connecting endpoints
That does not give the standard free-end proof.
Mixing candidate digits
Both strings and the elimination target use the same digit.
Eliminating from the connecting box automatically
The target rule is not “remove candidates from the box.”
The target must see both free ends.
Eliminating from a cell that sees only one free end
Either free end could be the true digit, so one-sided visibility is insufficient.
Assuming every valid Kite has an elimination
Always check the common-peer region.
A practical Two-String Kite recognition drill
With one digit highlighted:
- circle row conjugate pairs;
- circle column conjugate pairs;
- inspect boxes for a distinct row endpoint + column endpoint pair;
- mark the opposite endpoints;
- ask whether any candidate sees both opposite endpoints.
This is far more reliable than trying to recognize a literal kite shape in the full candidate grid.
FAQ
Why is it called Two-String Kite?
The row Strong Link and column Strong Link are the two “strings,” and common diagrams resemble a kite. The logical relationships matter more than the drawing.
Do the two connecting candidates have to be in the same box?
In the standard Two-String Kite, yes. Their shared box supplies the Weak Link between the two strings.
Can the two connecting endpoints be the same cell?
Not in the standard pattern described here. They are distinct candidates in the same box; if one is false, its own Strong Link forces the corresponding free end.
Do the free ends need to see each other?
No. The elimination target must see both free ends.
Is Two-String Kite a chain?
Yes. It is a named short one-digit chain pattern and can be represented within Turbot/X-Chain logic.
Can a Two-String Kite produce more than one elimination?
Yes. Every candidate of the pattern digit that sees both free ends can be removed.
What to learn next
Formalize Strong Links, Weak Links, and Chains so Two-String Kite and Skyscraper become recognizable examples of a general inference language.