A guess that rules things out

01 / The briefing

Begin with the question.

Enigma was not defeated by one universal password or one person working alone. Polish cryptanalysts made crucial prewar advances, and wartime British work combined mathematics, machines, intercepted traffic and large teams. Your investigation concerns the logic of a crib: a proposed stretch of plaintext whose consequences can be tested against the ciphertext. You are not being handed a genuine wartime message to decrypt; the decisions ask how the documented process worked. Distinguish a promising candidate from a verified result, and distinguish decryption from useful intelligence. A machine can narrow a search without supplying the entire answer. The final explanation must leave room for operators, builders, linguists and analysts as well as the people whose names became best known.

The timeline

1. 1930s, before the war

   Polish cryptanalysts develop important attacks on Enigma.

2. 1939

   British wartime codebreaking builds on shared Polish knowledge and further research.

3. 1940-03-14

   The first British Bombe, Victory, begins work at Bletchley Park.

4. 1941-02-28

   Hut 6 breaks the light-blue German air-force operational key described in Bletchley Park’s exhibition.

5. 1945, by war’s end

   Bombe operations have expanded into a large staffed network.

A researched reconstruction for learning. These reasoning steps simplify a complex record; no score can capture the full history.

02 / The evidence

What does the record show?

Read each exhibit before settling on an explanation. The numbered source links below every exhibit lead to the record behind it.

03 / Your reasoning

Follow the strongest explanation.

Choose an interpretation, then compare it with the evidence. You can revise your choice. The goal is understanding, not a perfect score.

04 / The findings

The chain behind the outcome.

The decisive reasoning move is to turn a proposed plaintext into a set of constraints, then use those constraints to reject incompatible settings. That is different from treating a guess as truth or imagining that a machine simply tried every complete message until one sounded right. Surviving candidates still required checking. The wider achievement was a sustained production system: interception, cryptanalysis, engineering, machine operation, decryption, translation and analysis had to work together. Turing and Welchman made important contributions, while Polish breakthroughs and the labor of many others are indispensable to an accurate account. Nor was every key always solved. For the player, the transferable lesson is procedural: make the hypothesis testable, distinguish rejection from confirmation, and inspect the handoffs between technical output and practical use. A breakthrough can be both intellectually remarkable and fundamentally collective.

Take the method with you

• Make a guess generate falsifiable constraints.
• Treat candidate generation and verification as separate stages.
• Credit the whole information pipeline, including prewar foundations.

You can read findings at any time. Exploring every reasoning step marks this case as complete in your notebook.