Ruling — Turing Machine

← Turing Machine

You asked

How do I play?

Answered counted as answered

Asked with: Turing Machinebg-356123-en-1e

To play the game, follow these steps:

Setup

1. Place the Machine tile in the centre of the table.[1]

2. Assemble the punch-card support.[1]

3. Place the punch cards in the support, with all cards in the front, followed by all others.[1]

4. Choose a Problem to solve.[1]

5. Place the Criteria cards in front of their assigned Verifier.[1]

6. Place the Verification cards face down in front of their assigned Verifier, next to the Criteria card.[1]

7. Give a Player Aid (which doubles as a screen) and a note sheet to each player.[1]

8. If playing from the online app, note down the number of the game.[1]

Round Structure

All players individually and simultaneously perform the following steps:

1. Compose: Compose a 3-digit proposal by overlaying 3 different-coloured cards: a number, a number, and a number.[2] If a needed card is being used by another player, wait until they have finished to take it.[3][2]

2. Question: Question up to 3 Verifiers during the round.[3][2] You must keep the same proposal for the entire round.[3] You question a Verifier by asking if your proposal passes their test.[2] You must compose your proposal and question Verifiers at the same time as other players.[3]

3. Deduce: Place the Verifier's Verification card under your proposal, ensuring it is properly lined up with the punch cards using the symbols in the corners.[2] You will see the Verifier's answer (pass or fail) through the hole created by overlapping the 3 punch cards.[2]

* If the Verifier answers $\checkmark$, your proposal passed the test.[2]

* If the Verifier answers $\times$, your proposal failed the test.[2]

* Immediately put the Verification cards back in front of the correct Verifier after questioning.[3]

* You must write down on your note sheet your proposals and the answer to ALL questions asked.[3] This serves to determine the winner in case of a tie.[3]

4. End of Round: (The sources do not list specific actions for this step other than the completion of the round sequence).[2]

Winning and Ending the Game

1. If one or more players think they have found the code, they must write it secretly and clearly on their note sheet.[4]

2. Each player checks their code against the SOLUTIONS section of the booklet or the appropriate button in the application.[4]

3. To prove the code is correct, compose it with the punch cards and ensure it passes the tests of all Verifiers.[4]

4. If more than one person is correct, the winner is the one who found the code asking THE FEWEST questions.[4]

5. If there is still a tie, all tied players win.[4]

6. If nobody finds the correct code, incorrect players are eliminated and the game continues for the remaining players.[4]

7. If only one player remains, they win by default.[4]

8. When the game is over, erase the $\text{V}$ on the back of the Verification cards.[1][4]

[1] RULEBOOK Turing Machine — Rulebook · p.2 · SETUP FOR YOUR FIRST GAME · SOLO AND COOPERATIVE MODES · Verifier:

[2] RULEBOOK Turing Machine — Rulebook · p.3 · GAMEPLAY · ROUND STRUCTURE · 1. COMPOSE · 2. QUESTION · The Verifier's Answer · ADVANCED STRATEGY:

[3] RULEBOOK Turing Machine — Rulebook · p.4 · EXAMPLE OF PLAY · Game Order: · There aren't enough punch cards: · Don't get mixed up: · Number of Questions per round: · You must keep the same proposal for the entire round: · …

[4] RULEBOOK Turing Machine — Rulebook · p.3 · VERIFICATION AND END OF GAME

Now you know — make it count.

🔧 debug — where this ruling came from

outcome: ANSWERED — Answered
corpus profile: live,vps
answerer pin (deploy-frozen, attribution only): gemma4:26b think:false 5571076f3d70
timings: search 110 ms · ask 5056 ms · total 5169 ms
single-flight (PR-5): queued 0 ms · generation 5169 ms
retrieval refs (raw) — what the PASSAGE SEARCH returned, not what the answerer read: [{"page": 2, "score": 0.04918, "snippet": "Place the Machine tile in the centre of the table. 2 3 Assemble the punch-card support. Do not take it apart at the end of the game; store it in the box as is. Place the punch cards in the support: all cards in the front, followed by all and so on. Choose a Problem to solve (on the next page). Numbe", "headingPath": "SETUP FOR YOUR FIRST GAME · SOLO AND COOPERATIVE MODES · Verifier:", "sharpsignalDocId": 424}, {"page": 1, "score": 0.047123, "snippet": "A game by Yoann Levet and Fabien Gridel British mathematician and cryptanalyst Alan Turing made a significant contribution to the advent of computers. We are offering you a chance to use a proto-computer, working without electricity or electronics, to find secret codes. Be the first to find the only", "headingPath": "GOAL", "sharpsignalDocId": 424}, {"page": 3, "score": 0.046898, "snippet": "Unlike many deduction games, you won't be questioning the other players, but a machine. This machine consists of 4 to 6 Verifiers, a kind of artificial intelligence. Each verifier checks for one single aspect, one single criterion. Questioning a Verifier consists of asking them if your proposal pass", "headingPath": "GAMEPLAY · ROUND STRUCTURE · 1. COMPOSE · 2. QUESTION · The Verifier's Answer · ADVANCED STRATEGY:", "sharpsignalDocId": 424}, {"page": 5, "score": 0.046432, "snippet": "The Veri2er veri2es that the number is less than , equal to , or greater than another particular number (that they know). The Veri2er veri2es that the number of 1s or the number of 3s in the code is equal to a particular number (that they know). The Veri2er veri2es that that the number of a particul", "headingPath": "Cards 43 to 44 · Cards 45 to 47 · Card 48 · HANDICAP SYSTEM", "sharpsignalDocId": 424}, {"page": 4, "score": 0.046394, "snippet": "Show this example to anyone who is learning the game. Here is a problem with 4 criteria: In the first round, you put together this proposal and you write it on your note sheet. Verifier A verifies one criterion. This criterion could be either \" The number is equal to 1 \" or \" The number is greater t", "headingPath": "EXAMPLE OF PLAY · Game Order: · There aren't enough punch cards: · Don't get mixed up: · Number of Questions per round: · You must keep the same proposal for the entire round: · …", "sharpsignalDocId": 424}, {"page": 2, "score": 0.044776, "snippet": "Difficulty Factor / Luck B 9 B B B B fi A B C D A B C 8 12 15 17 4 9 18 356 695 329 618 fi 335 fi 362 fi 421 fi fi fi fi D 20 747 B A Verifier fi 677 217 634 4 9 13 A B C fi fi D 17 528 fi B A B C D A B C D 9 11 16 19 21 23 28 41 48 fi 279 515 770 523 681 244 440 737 fi fi fi fi fi fi fi A B C D A B", "headingPath": "PROBLEMS · ONLINE PROBLEMS · You will also find 2 new , more challenging modes of play .", "sharpsignalDocId": 424}, {"page": 3, "score": 0.032258, "snippet": "If one or more players think they have found the code, they should write it secretly (and clearly!) on their note sheet . Each one then checks, in turn, the SOLUTIONS section at the bottom of p. 3 in this booklet, or uses the appropriate button in the application, and verifies if their code is corre", "headingPath": "VERIFICATION AND END OF GAME", "sharpsignalDocId": 424}, {"page": 4, "score": 0.029469, "snippet": "At the beginning of every game, take the time to discuss and understand the meaning of each Criteria card. To help with this, here are some remarks and clarifications for each card. Cards with very similar structures have been grouped together in this list. To pass the test of this Verifier, you mus", "headingPath": "CRITERIA CARD EXPLANATIONS · Card 1 · Cards 2 to 4 · Cards 5 to 7 · Cards 8 to 10 · DO YOU THINK THE MACHINE HAS MADE A MISTAKE? · …", "sharpsignalDocId": 424}]
citations (raw) — what the answer cited, chosen from a retrieval this page cannot show: [{"page": 2, "quote": null, "headingPath": "SETUP FOR YOUR FIRST GAME · SOLO AND COOPERATIVE MODES · Verifier:", "sharpsignalDocId": 424}, {"page": 3, "quote": null, "headingPath": "GAMEPLAY · ROUND STRUCTURE · 1. COMPOSE · 2. QUESTION · The Verifier's Answer · ADVANCED STRATEGY:", "sharpsignalDocId": 424}, {"page": 4, "quote": null, "headingPath": "EXAMPLE OF PLAY · Game Order: · There aren't enough punch cards: · Don't get mixed up: · Number of Questions per round: · You must keep the same proposal for the entire round: · …", "sharpsignalDocId": 424}, {"page": 3, "quote": null, "headingPath": "VERIFICATION AND END OF GAME", "sharpsignalDocId": 424}]
boost provenance — errata + base rulebook (E2/E3): no registered errata card matched this query; base rulebook doc 424 boosted; rulesage.errata.boost-enabled=true, rulesage.errata.supersedence-enabled=true
base rulebook doc 424 boosted
answered-before recall: this ruling was answered, so past rulings were not offered
similarity threshold in force: 0.55 (rulesage.answered-before.similarity-threshold; the exact-question tier is not gated by it)
answer fence: passed — letter density 0.89367 of 2370 non-space chars (floor 0.45); 0 glyph-index tokens (max 2)
debug row recorded: Aug 26, 2026 08:51 UTC

retrieval — what the passage search returned

what this block IS: the PASSAGE SEARCH's own results — the same search that fills this page's closest-passages list — and NOT the passages the answerer read. Answering runs its OWN retrieval: a far wider candidate pool, re-ranked down to a final handful, plus floors this search never applies — the base rulebook, surviving errata corrections, and one slot per book on a multi-book read. Each of those armed only if THIS ask sent what it needs: the boost block names the ids it forwarded, and the scope line names the books it read. A document the answer CITES that no row here names is therefore EXPECTED, not a defect: two searches, two candidate pools, two orders. The answerer's own final rows are shown in their own block below, beside these and never mixed into them.

score = the fused retrieval score (reciprocal-rank fusion over the search arms) — NOT a cosine similarity. This ruling ran the THREE-ARM fuse (full-text + vector + the doc-priority boost arm, which carried the base rulebook and/or the errata corrections this query matched), whose arithmetic ceiling is 0.04918 — all three arms ranking the same chunk #1 (ceiling = arms/(k+1) at k=60). The measured healthy band 0.016–0.033 was measured on TWO-arm asks and does not bound this one: its high end is the two-arm ceiling, and a third arm has room above it. A chunk only one arm ranked highly lands near 0.016 (that one arm's #1 vote), so 0.03 here is an excellent hit, not a 3% match.

per-arm ranks (the rank each search arm gave a chunk): NOT DISCLOSED by the gateway. Fusion happens gateway-side and only the FUSED score crosses the wire, so rulesage cannot show them without a gateway change. The rank column below is the FUSED rank (position in the returned list), which is real.

token count per chunk: NOT DISCLOSED — chunk token counts are not reported on the ask path. The character counts below are of the bounded snippet/quote rulesage actually received — a real measurement of what we hold, never an estimate of the chunk.

fused rank	document	heading	page	fused RRF score	snippet chars
#1	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	SETUP FOR YOUR FIRST GAME · SOLO AND COOPERATIVE MODES · Verifier:	p.2	0.04918 (at the 3-arm ceiling (0.04918) — every arm ranked it #1)	300
#2	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	GOAL	p.1	0.047123 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300
#3	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	GAMEPLAY · ROUND STRUCTURE · 1. COMPOSE · 2. QUESTION · The Verifier's Answer · ADVANCED STRATEGY:	p.3	0.046898 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300
#4	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	Cards 43 to 44 · Cards 45 to 47 · Card 48 · HANDICAP SYSTEM	p.5	0.046432 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300
#5	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	EXAMPLE OF PLAY · Game Order: · There aren't enough punch cards: · Don't get mixed up: · Number of Questions per round: · You must keep the same proposal for the entire round: · …	p.4	0.046394 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300
#6	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	PROBLEMS · ONLINE PROBLEMS · You will also find 2 new , more challenging modes of play .	p.2	0.044776 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300
#7	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	VERIFICATION AND END OF GAME	p.3	0.032258 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300
#8	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	CRITERIA CARD EXPLANATIONS · Card 1 · Cards 2 to 4 · Cards 5 to 7 · Cards 8 to 10 · DO YOU THINK THE MACHINE HAS MADE A MISTAKE? · …	p.4	0.029469 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	300

what the answerer read — the passages it actually had in front of it

what this block IS: the passages the ANSWERING read put in front of the answerer, in the order it read them — the other half of the two reads described above, and the one that decides what the answer could possibly say. Each row names the book it came from and where in that book it sits, what it scored when the search arms were fused, which arm carried it there, and whether the re-ranker chose it or a floor guaranteed it a slot. A row here that no passage-search row names is EXPECTED: a far wider pool, re-ranked, with floors the passage search never applies.

candidate pool: the answering read scored 12 passages, out of a ceiling of 80 set gateway-side. Both figures are reported by the gateway for THIS ask — measurements of what actually happened, not constants read out of anyone's source and printed here on faith.

floors armed for this ask: the base rulebook — armed · surviving errata corrections — not armed · one slot per book on a multi-book read — not armed. Every floor is stated on every ask, armed or not, so a floor that did not apply here is never mistaken for one this app does not know about.

arms fused for this ask: vector + full-text + the doc-priority boost arm. Stated separately from the rows because an arm that ran and carried nothing is a different fact from an arm that never ran.

read at	document	heading	page	fused rank	fused RRF score	carried by	how it got its slot
#1	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	SETUP FOR YOUR FIRST GAME · SOLO AND COOPERATIVE MODES · Verifier:	p.2	#1	0.04918 (at the 3-arm ceiling (0.04918) — every arm ranked it #1)	vector + full-text + the doc-priority boost arm	the re-ranker chose it
#2	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	EXAMPLE OF PLAY · Game Order: · There aren't enough punch cards: · Don't get mixed up: · Number of Questions per round: · You must keep the same proposal for the entire round: · …	p.4	#5	0.046394 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + full-text + the doc-priority boost arm	the re-ranker chose it
#3	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	VERIFICATION AND END OF GAME	p.3	#7	0.032258 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + the doc-priority boost arm	the re-ranker chose it
#4	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	PROBLEMS · ONLINE PROBLEMS · You will also find 2 new , more challenging modes of play .	p.2	#6	0.044776 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + full-text + the doc-priority boost arm	the re-ranker chose it
#5	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	CRITERIA CARD EXPLANATIONS · Card 1 · Cards 2 to 4 · Cards 5 to 7 · Cards 8 to 10 · DO YOU THINK THE MACHINE HAS MADE A MISTAKE? · …	p.4	#8	0.029469 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + full-text	the re-ranker chose it
#6	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	Cards 43 to 44 · Cards 45 to 47 · Card 48 · HANDICAP SYSTEM	p.5	#4	0.046432 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + full-text + the doc-priority boost arm	the re-ranker chose it
#7	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	GAMEPLAY · ROUND STRUCTURE · 1. COMPOSE · 2. QUESTION · The Verifier's Answer · ADVANCED STRATEGY:	p.3	#3	0.046898 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + full-text + the doc-priority boost arm	the re-ranker chose it
#8	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	GOAL	p.1	#2	0.047123 (healthy, below this ruling's 3-arm ceiling 0.04918 (the measured band 0.016–0.033 was taken on two-arm asks and does not bound a 3-arm one))	vector + full-text + the doc-priority boost arm	the re-ranker chose it

chosen chunks — what the answer actually cited

#	document	heading	page	quote chars
[1]	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	SETUP FOR YOUR FIRST GAME · SOLO AND COOPERATIVE MODES · Verifier:	p.2	no quote on the wire
[2]	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	GAMEPLAY · ROUND STRUCTURE · 1. COMPOSE · 2. QUESTION · The Verifier's Answer · ADVANCED STRATEGY:	p.3	no quote on the wire
[3]	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	EXAMPLE OF PLAY · Game Order: · There aren't enough punch cards: · Don't get mixed up: · Number of Questions per round: · You must keep the same proposal for the entire round: · …	p.4	no quote on the wire
[4]	RULEBOOK Turing Machine — Rulebook (corpus doc 424)	VERIFICATION AND END OF GAME	p.3	no quote on the wire

generation — timing and the path taken

timing split: retrieval 110 ms · first delta 1544 ms · total 5169 ms (retrieval and first-delta both measured from the START of gateway work, so first-delta INCLUDES retrieval — do not subtract)
full breakdown: queued 0 ms · retrieval 110 ms · ask 5056 ms · gateway work 5169 ms · total 5169 ms
tokens in (the prompt the answerer read): 3503
tokens out (what the answerer generated): 710
tok/sec: 201.1 tok/sec — 710 output tokens in 3.530 s of generation
live seat (read from the running child): answering — gemma4:26b think:false · num_ctx 32768 (live-verified 43s ago)
answerer host (measured by rulesage): reachable (for 22h, checked 1s ago)
answerer node (the seat proxy's own header — this probe, not this ask): node1
stream path: streamed — the gateway pushed at least one accumulated draft
watchdog: first-token watchdog: 30s per arming window (rulesage.table.first-token-watchdog-seconds), re-armed once by the passages frame — so the worst case before a reader falls back to polling is 60s. Whether it actually fired is a BROWSER-side decision that never reaches the server, so it is not recorded here. The stream path above is the server's half of that story: whether a delta was emitted at all.
num_ctx · think posture: both are the CHILD's settings, not rulesage's, and no ask reply carries them — an answer never states which context window or think posture produced it. The live-seat line above reads them from the running child instead, where the gateway can answer for itself; it describes the child NOW, not this ask.

disposition

outcome: ANSWERED — Answered
abstain rationale (n/a — this ruling answered): answered — no abstain rationale applies

setup-shape — why the checklist band did or didn't render

decision: NOT_SETUP_SHAPED — no setup-shape pattern matched this question

errata registry — what the gate above had to match against

this game registers NO errata cards (edition 353), so "no registered errata card matched" above could never have matched one

Errata scope: the gate above matched this ruling's own edition only. When an ask also reads an expansion, that expansion's own registered errata cards stay outside the match — a stated phase-1 limitation, not a failed lookup.