Find the symbol: the hidden geometry of the cards

Two cards, many pictures and exactly one match. The room-based symbol game uses a complete deck of 57 cards, 57 distinct symbols and 8 symbols on every card. This article explains the construction and proves its guarantee, without programming.

1. The problem: every pair must work
2. A complete seven-card example
3. Symbols as points, cards as lines
4. Arithmetic modulo 7 and symbol numbers
5. Constructing 49 nonvertical cards
6. Seven vertical cards and the final card
7. Proof: equal directions
8. Proof: different directions
9. Proof: the remaining three cases
10. Counting the complete deck
11. Why use a prime?
12. Shuffling, checking and exercises

1. The problem: every pair must work

Any two distinct cards must share exactly one symbol. Each card has the same number of distinct symbols. If Cᵢ denotes the set on card i, the condition is:

|Cᵢ ∩ Cⱼ| = 1 for every i ≠ j

The intersection ∩ contains the shared elements. Randomly distributing pictures does not guarantee this rule. Checking only consecutive cards is insufficient: every pair matters. The geometric construction also balances the frequencies of all symbols.

2. A complete seven-card example

Use symbols A to G, three per card. The columns are the seven cards:

Cards 1 and 2 share A; cards 2 and 4 share D; cards 3 and 7 share F. All 7·6/2=21 pairs satisfy the rule. Every symbol occurs three times. This is the Fano plane, the projective plane of order 2.

3. Symbols as points, cards as lines

Let each symbol be a point and each card a line containing its points. The requirement becomes: two different lines meet at exactly one point. Ordinary parallel lines do not meet, so we add one point for each direction. All parallels in a direction share that point at infinity. These additional points form a new line, the line at infinity.

In the game, direction points are ordinary pictures, not special playing pieces. A finite projective plane makes this geometry possible with finitely many points and lines.

4. Arithmetic modulo 7 and symbol numbers

Use the numbers 0 to 6. Working modulo 7 means keeping the remainder after division by 7: 10 ≡ 3, 17 ≡ 3 and 21 ≡ 0 (mod 7). Also −1 ≡ 6. Think of a seven-position clock.

Take the 49 points (x,y) with both coordinates from 0 to 6. Assign a different symbol to each point using:

S(x,y) = 1 + 7x + y

Thus S(0,0)=1, S(0,6)=7 and S(1,0)=8. These are symbols 1 to 49; symbols 50 to 57 will represent directions. Numbers are identifiers replaced by pictures on screen.

5. Constructing 49 nonvertical cards

For each m and b from 0 to 6, take:

y ≡ mx + b (mod 7)

m specifies the direction and b distinguishes parallel lines. For each x from 0 to 6, calculate y and place S(x,y) on the card. Add direction symbol 50+m. There are 7·7=49 choices and eight symbols per card.

For m=1, b=0, the equation is y=x. Its seven points are (0,0), (1,1), …, (6,6), giving:

{1, 9, 17, 25, 33, 41, 49, 51}

51 is the direction symbol. These equations use remainders, not unrestricted coordinates on an ordinary infinite sheet.

6. Seven vertical cards and the final card

For each c from 0 to 6, take (c,0), …, (c,6) and add symbol 57 for the vertical direction. For x=0 the card is:

{1, 2, 3, 4, 5, 6, 7, 57}

Finally include the card of all directions, the line at infinity:

{50, 51, 52, 53, 54, 55, 56, 57}
Total cards: 49 + 7 + 1 = 57

The procedure is complete: grid symbols, nonvertical cards, vertical cards, final card. No random search or subsequent repairs are needed.

7. Proof: equal directions

Take y ≡ mx+b₁ and y ≡ mx+b₂ with different intercepts. For a fixed x their y values differ, so they share no grid point. Both cards contain direction symbol 50+m. This is their only common symbol.

8. Proof: different directions

For y ≡ m₁x+b₁ and y ≡ m₂x+b₂, a common point must satisfy:

(m₁ − m₂)x ≡ b₂ − b₁ (mod 7)

Different directions make the coefficient nonzero modulo 7. Because 7 is prime, every nonzero element has a multiplicative inverse; for example 3·5 ≡ 1. The equation therefore has exactly one x and then one y. Direction symbols differ, leaving exactly one common symbol.

Example: y=x and y=2x+1 give x ≡ 2x+1, hence x=6 and y=6 modulo 7. The shared symbol is S(6,6)=49. The second card is {2,11,20,22,31,40,49,52}, confirming that only 49 matches.

9. Proof: the remaining three cases

1. Vertical and nonvertical: x=c gives a unique y ≡ mc+b. They have one grid point and no direction symbol in common.
2. Two different verticals: no common grid point, but both contain 57.
3. Final card and any other: the final card contains only directions, and every other card contains exactly one direction.

These cases cover every possible pair, completing the proof for the whole deck.

10. Counting the complete deck

For order n, there are n² grid points and n+1 direction points. There are n² nonvertical lines, n vertical lines and the final line:

Symbols per card = n + 1
Cards = distinct symbols = n² + n + 1

A grid point belongs to one line in each of n nonvertical directions and one vertical. A direction point belongs to its n parallels and the final line. Every symbol therefore occurs n+1 times. With n=7, there are 57·8=456 symbol appearances.

Alternatively fix a symbol. Its n+1 cards each contribute n other symbols, without repetitions, since a repetition would produce two matches. In the complete plane these cover all other symbols: 1+n(n+1)=n²+n+1.

This formula describes the complete construction, not every family of pairwise matching cards. Removing cards preserves the remaining pairwise matches but can unbalance symbol frequencies.

11. Why use a prime?

Ordinary modular arithmetic gives inverses for every nonzero element when the modulus is prime. For a composite modulus this can fail: 2x ≡ 0 (mod 6) has both x=0 and x=3 as solutions, so intersections need not be unique.

n = 2 → 3 symbols/card, 7 cards
n = 3 → 4 symbols/card, 13 cards
n = 5 → 6 symbols/card, 31 cards
n = 7 → 8 symbols/card, 57 cards
n = 11 → 12 symbols/card, 133 cards

This does not prove all composite orders impossible. It establishes this remainder-based construction for prime orders; replacing 7 by an arbitrary number is not justified.

12. Shuffling, checking and exercises

After construction, shuffle cards and symbols and vary picture positions, sizes and rotations. Membership remains unchanged, so the guarantee survives. Independently deleting or replacing pictures on individual cards would not preserve it.

A full check verifies 57 cards, eight distinct symbols per card, identifiers 1 to 57, eight appearances per symbol, and exactly one intersection element for each of the 57·56/2=1596 pairs.

Conclusion: geometry guarantees one answer. The player’s challenge is to spot it quickly.

The geometry of the Game DOBBLE — Cecilia Salgado