Card rules · 2026-10-29
Follow One Complete 13-Card Hand
A valid 13-card rummy hand needs more than one attractive group. Under the rules used in this lesson, all thirteen cards must belong to valid groups, at least two groups must be…
A valid 13-card rummy hand needs more than one attractive group. Under the rules used in this lesson, all thirteen cards must belong to valid groups, at least two groups must be sequences, and at least one sequence must be pure. Finding a pure sequence is a beginning, not the end of the check.
The following thirteen-card example uses no wild cards. A sequence contains at least three consecutive ranks in one suit; a set contains matching ranks in different suits. The finished hand must use every card exactly once.
The hand before the draw
Imagine these thirteen cards in four rows:
3♥ 4♥ 5♥ 8♣ 9♣ 10♣ Q♠ Q♥ Q♦ 6♦ 7♦ 8♦ K♣
The first two rows are sequences: consecutive ranks in one suit. The queens form a set because their ranks match and their suits differ. In the last row, 6♦–7♦–8♦ is another sequence, but K♣ belongs to none of these groups. Twelve cards are organised; the whole hand is still incomplete.
One draw and one discard
For this worked example, the next card is 9♦. The working hand now contains fourteen cards. Remove K♣ as the discard, leaving:
3♥ 4♥ 5♥ / 8♣ 9♣ 10♣ / Q♠ Q♥ Q♦ / 6♦ 7♦ 8♦ 9♦
Count the final groups: 3 + 3 + 3 + 4 = 13. There are three natural sequences and one set. No joker substitutes for a missing card. Every physical card appears once. The hand therefore satisfies the grouping conditions stated at the start.
Before that draw, the nine was not part of the hand and could not be counted.
Why a nearly identical picture can fail
Replace the drawn 9♦ with 9♠, keeping every other card unchanged. The last row becomes 6♦–7♦–8♦–9♠. The ranks are consecutive, but the suits are not. The three diamonds remain a sequence; the spade nine remains outside it. A fourth card beside a valid group does not automatically join that group.
Sorting also cannot fix this mismatch. It can move the spade nine on screen, but cannot turn it into a diamond.
What a declaration checks
The final thirteen cards are the object of the check. A discarded card cannot continue helping an old group, and one card cannot be used in two groups. The examples deliberately avoid joker and ace edge cases so the basic process stays visible: identify the groups, account for all thirteen cards, then apply the sequence requirements.