Why 42 Is a Mathematical Boundary

Open with the driving question: if no human has ever needed 42 moves, what stops a future algorithm from needing 43? Frame the tension between 'record someone could break' and 'boundary no puzzle can exceed.'

• State the driving question explicitly on screen
• Pose the record-vs-boundary contrast as the puzzle
• Invite the learner to hold their intuition before evidence arrives

A single-question prediction widget asks the learner to commit to one view of 42 before any proof evidence is shown. Forces a hypothesis the later scenes will test.

• Choose between 'World record — some algorithm could beat it' and 'Mathematical boundary — no position can ever exceed it'
• Reveal that the learner is committing to a falsifiable claim
• No correct answer is exposed yet

Show the concrete numbers that make brute force impossible on the 3×3: 43,252,003,274,489,856,000 states, ~20 legal face-turn moves per position, total branches far beyond any computer. Contrast with the 2×2 Pocket Cube's 3,674,160 states which can be fully enumerated — proving that 'we searched everything' only works on small cubes.

• Display the exact state count of the 3×3 and the 2×2 side by side
• Show that even at a billion states per second, exhaustive search on the 3×3 would take longer than the age of the universe
• Make visible why the 42 result cannot be an empirical record

An interactive diagram widget lets the learner click a position on the 2×2 Pocket Cube and see its true optimal distance flash on a distance-from-solved chart. The full chart reveals a maximum of 11 moves — proving by exhaustion that 'God's Number for 2×2 equals 11' is a boundary, not a record.

• Manipulable 2×2 cube to scramble and inspect
• Live readout of optimal distance for the current position
• Histogram view showing the full distance distribution peaking at 11

Explain the 2014 Rokicki-Kociemba proof in intuitive terms: the 3×3's moves separate into 'inner' turns (that keep the centers fixed) and 'outer' setups. By fixing one move at the start, the search space splits into ~8.7 billion cosets. Each coset can be solved at depth ≤ 12, plus a single setup move gives ≤ 13 — and combined with the 29-move half-turn metric proof yields 42 in face-turn metric.

• Cosets are equivalence classes obtained by fixing the first move
• Every position lies in exactly one coset
• Proving depth ≤ 12 inside every coset proves depth ≤ 13 in half-turn metric, which converts to 42 in face-turn metric

Boundary case clarifying the proof's strength: 42 is the least upper bound because (a) specific 'superflip' and 'checkerboard' positions are known to require exactly 20 face turns, and (b) the coset argument is exhaustive over all states — so 42 cannot be lowered without contradicting a verified computation, and cannot be raised because the proof is complete.

• Lower-bound positions like the superflip pin 20 as the floor
• The upper-bound proof covers every state, not a sample
• Therefore 42 is locked in as the exact value of God's Number

Transfer scene: a single-question quiz widget asks the learner whether the same exhaustive-coset method could establish a boundary for the quarter-turn metric, and which value would be expected. Tests whether they can generalize the boundary concept rather than memorize 42.

• Apply the proof structure to a changed metric
• Commit to one answer
• Receive feedback explaining why the same machinery generalizes

Directly answer the driving question: 42 is a mathematical boundary because the 2014 Rokicki-Kociemba proof partitioned every one of the 43 quintillion positions into cosets and showed each is solvable in at most 42 face turns. No future algorithm, computer, or cube can ever require more — that is the definition of a bound, not a record.

• Restate the answer in one sentence
• Summarize the proof structure in three steps
• Close by connecting the record-vs-boundary contrast back to the opening tension