Signal

The shape of a guess.

DVC Games · 2025 · cooperative deduction

The box ships 25 Alien cards. Each card holds three hidden rewrite rules and one printed goal signal. Phase 1 applies rule 1 only. Phase 2 layers rule 2 on top of rule 1. Phase 3 layers all three. In each phase the Experts have ten transmissions to make the Alien’s response match the printed goal.

Donald Knuth published a kindred problem in 1976. The information bound that links them governs how to play either, and is what this page is about.

Bits per round
15.4
log₂ 43 758
Bits to identify the deck
4.6
log₂ 25 alien cards
Transmission tokens
30
10 × 3 phases

Act 1The mat

What the alphabet looks like


The game ships with a fabric mat and 40 signal tokens — rods, cubes, discs, and triangles, in black and white, eight kinds in total. Each Alien card holds three numbered rules and one printed goal signal. Phase 1 applies rule 1 only. Phase 2 layers rule 2 on top. Phase 3 layers rule 3 on top of those.

Every rule the rulebook permits is a composition of three primitive verbs: adjust (rewrite each token via a function), remove (drop tokens matching a predicate), and add(append a fixed multiset). Adjustments preserve size; removals shrink it; adds grow it. The rule language is a free monoid generated by these three. The puzzle’s difficulty isn’t in any single rule’s complexity — it’s in how rules at later phases interact with rules at earlier ones.

Eight tokens — click one

Inverterrewrites
Sieveremoves
(gone)
Pebblerrewrites
+ 1 disc
Twinrewrites
Reaperrewrites
+ 1 cube
theoremAudrey.Signal.Rule.remove_idem
Rule.comp (Rule.remove p) (Rule.remove p) = Rule.remove p

Removals are idempotent — applying the same removal twice is the same as once.

Audrey/Signal/Transforms.lean

Act 2Probe

The deduction, on a worked example


The published deck has 25 Alien cards. For teaching, we use a small five-rule sample below — Inverter (flip every colour), Sieve (drop white tokens), Pebbler (append a black disc), Twin (cubes → discs, rods → triangles), and Reaper (drop triangles, append a black cube). One is hidden. Transmit, read the response, narrow the partition. The bar above the controls tracks bits collected; when it fills, the rule is identified.

Probe the alien

bits collected0.00 / 2.32
still consistent (5 of 5)
InverterSievePebblerTwinReaper

send a probe

No transmissions yet. Pick a probe above.

I deduce the rule is

A practitioner’s sequence on this five-rule slice: empty mat first, then one of each. Two transmissions usually end the puzzle, sometimes one. Against the full 25-card deck the same sequence works because the deck’s response-fingerprints are even more spread out.

The “one of each” probe

Two colours, four shapes, eight combinations: black cube, black disc, black rod, black triangle, white cube, white disc, white rod, white triangle. Lay all eight on the mat and you have sent one of each. Audrey’s mom Jill says it about desserts; the probe says it about tokens.

Why it works as a single transmission: every adjustment, every removal, and every addition that the rulebook can express has to act on at least one of those eight inputs. An Inverter flips all eight colours. A Sieve drops the four whites. A Twin remaps cubes to discs and rods to triangles. A Reaper drops the two triangles and appends. No rule can hide from this input — the response carries fingerprints from every transformation the rule applies.

That is why the standard opener pairs an empty mat with one of each. Empty mat exposes additions — everything the rule prepends from nothing. One of each exposes adjustments and removals — every transformation the rule can do tosomething already on the table. Two transmissions, full coverage of the rule’s vocabulary.

Act 3Size

Count the tokens, not the colours


One number on the mat is doing more work than any other: how many tokens come back. An adjustment leaves the count fixed. A removal can only shrink it. An addition can only grow it. A composition is a sum of those moves.

theoremAudrey.Signal.Rule.adjust_size
∀ (f : Token → Token) (m : Mat),
  (Rule.adjust f m).size = m.size
Audrey/Signal/Transforms.lean
theoremAudrey.Signal.Rule.remove_size_le
∀ (p : Token → Bool) (m : Mat),
  (Rule.remove p m).size ≤ m.size
Audrey/Signal/Transforms.lean
theoremAudrey.Signal.Rule.add_size
∀ (extra : Mat) (m : Mat),
  (Rule.add extra m).size = m.size + extra.size
Audrey/Signal/Transforms.lean

The empty mat partitions the catalogue by response size alone. Three rules return an empty mat; two return one token. The shape of that lone token splits the latter pair instantly.

Response size on the empty mat — by rule
Inverter
size 0
Sieve
size 0
Pebbler
size 1
Twin
size 0
Reaper
size 1

Of the five sample rules charted here, three return an empty mat. Pebbler and Reaper both add one token, distinguishable by shape.

Act 4Numbers

Information at the speed of one round


Eight token kinds. Up to ten tokens on the mat. The number of distinct responses the Alien can produce is the stars-and-bars count of multisets of eight kinds with at most ten elements — multichoose 9 10 = 43 758. Each round carries about 15.4 bits of distinguishing power. The 25-card deck is 4.6 bits. Even the layered three-rule hypothesis space (25³ = 15 625) is under 14 bits. One transmission has the channel capacity to identify any of these.

Bits needed vs bits available, in the same units
Identify the Alien (25-card deck)
4.6 bits
Identify a 3-rule layered space (15 625)
13.9 bits
Identify a Mastermind code (1296)
10.3 bits
One Mastermind feedback (15 vals)
3.9 bits
One Signal transmission (43 758 vals)
15.4 bits
One full Signal phase (10 transmissions)
154.2 bits

Grey: bits the deduction needs. Teal: bits the channel provides. The gap is the asymmetry that makes Signal playable.

Signalisn’t hard because information is scarce. It’s hard because the three rules compose, later rules re-shape what earlier rules did, and the social constraint of cooperative play limits communication to the mat itself. The channel is wide; the deduction is narrow.

Act 5Budget

Ten tokens, three phases, thirty points


The rulebook caps round counts on both ends. The box ships ten transmission tokens per phase, three phases per Alien card. An Expert team has thirty transmissions total to solve a card; every unused token at the end is a point. Score is not win-or-lose — it is how cleanly you found the rule.

The transmission budget — one Alien card
Phase 1+ 1 rule
+7 pts
Phase 2+ 1 rule
+7 pts
Phase 3+ 1 rule
+7 pts

Total score (clean game)+21 of 30

Each phase has ten transmission tokens. Spent tokens are grey; banked tokens score. An efficient team uses three per phase — one to probe, one to discriminate, one to confirm — and banks twenty-one of thirty.

Knuth’s bound is the floor on rounds; the rulebook is the ceiling. The interesting question is whether the floor exceeds the ceiling for the catalogue at hand. For Signal, it does not — by a wide margin, and that margin is itself a kernel-checked theorem.

theoremAudrey.Signal.Phase.layered_deck_fits
DeckSize ^ PhaseCount ≤
  Fintype.card (BoundedMat MatCap) ^ TransmissionBudget

25³ ≤ 43 758¹⁰ — the layered three-rule space fits in a single phase budget, with room to spare.

Audrey/Signal/Phase.lean

Act 6Play

How to play, on either side


The strategy is phase-aware. In phase 1 you face one unknown; in phase 2 a known function and one unknown; in phase 3 a known composite and one unknown. Each phase’s job is to pin the new rule by sending inputs the previous phases’ rules already make predictable.

Three phases per Alien card · rules layer cumulatively
Phase 1
inputR₁
Find R₁ from a clean mat.
Phase 2
inputR₁R₂
R₁ is known. Find R₂ on R₁'s output.
Phase 3
inputR₁R₂R₃
R₁∘R₂ is known. Find R₃ on the composite.

For the Experts: spend bits, not tokens

Three transmissions per phase fit comfortably in the budget: one to open the unknown, one to discriminate among the candidates, one to confirmthe prediction. Knuth’s minimax in plain English: send the transmission whose response you cannot already predict.

Phase 1
Identify R₁
  1. OpenEmpty mat — reveals what R₁ adds
  2. DiscriminateOne of each — reveals what R₁ removes / rewrites
  3. ConfirmOne predicted input — verify before committing
Phase 2
Identify R₂
  1. OpenAn input whose R₁-image you can predict
  2. DiscriminateVary inputs that R₁ collapses, isolate R₂'s effect
  3. ConfirmPredict the layered response, transmit, check
Phase 3
Identify R₃
  1. OpenAn input whose R₁∘R₂ image you can predict
  2. DiscriminateProbe the composite; deduce R₃ on the intermediate
  3. ConfirmPredict the goal-matching transmission

A clean run spends nine transmissions and banks twenty-one of thirty.

For the Alien: cooperate, but resist

You picked the card and you can’t describe the rules. Every response leaks information — and your timing leaks more than the rulebook says. Be readable enough to be solved within the budget, no more.

  1. Pace uniformly
    Move tokens at the same speed whether the rule fires strongly or trivially. Slowing down when skipping a non-applicable rule telegraphs the negative case.
  2. Pick rules that interact
    A phase-2 rule that commutes with phase 1 is easy to read in isolation. Pick something whose effect depends on phase 1's output.
  3. Mask the size signal
    A pure removal or pure add changes the token count visibly. A remove-then-add of equal cardinality is size-neutral and hides the verb.
  4. Goal on the manifold
    An unreachable goal wastes Expert transmissions on search, not deduction. Pick a goal a clean transmission can hit.
  5. Don't volunteer
    The rulebook lets you correct recollection; it doesn't let you say hot or cold. Stay there.

What both sides share: every transmission is a question, and every response is information. Knuth’s minimax — pick the question whose answer you cannot already predict — is the same instruction in both seats. Your reward is shared; you both want the puzzle deduced, but only just.

Coda

The same machine, dressed twice


Knuth shipped his receipt for Mastermind half a century ago. DVC Games rebuilt the machine in 2025 with prettier pieces and a cooperative twist. Both run the same arithmetic: a hidden hypothesis, a public response, a finite budget, and the bit-budget that links them.

Signal’s puzzle isn’t mathematical scarcity; it’s structural commitment. You have the bits. Spend them well.

References.

Knuth, D. E. The Computer as Master Mind. Journal of Recreational Mathematics 9(1), 1–6 (1976–77).

Koyama, K. & Lai, T. W. An Optimal Mastermind Strategy. Journal of Recreational Mathematics 25(3), 251–256 (1993).

DVC Games. Signal — rulebook and Signal Support FAQ (2025). dvc.games/products/signal