Order from Chaos: The Galton Board

Random individual paths can produce a regular distribution in aggregate.

Canal
3Blue1Brown
Publicado
15 dic 2023
Vídeo
0:49
Lectura
1 min
Original
inglés
Abrir en YouTube
Al desplazarte, el vídeo se reduce a la esquina inferior derecha y sigue reproduciéndose. Los subtítulos siguen tu idioma de lectura.
Idioma de lecturaDisponible en 2 idiomas
Este artículo aún no está en español, así que se muestra el original en inglés.
RESUMEN

En 30 segundos

A Galton board illustrates how unpredictable individual outcomes can form a recognizable distribution across many trials.

  1. 1Individual randomnessA single event can be chaotic and hard to predict.
  2. 2Aggregate regularityMany events can display a predictable distribution.
  3. 3The bell curveThe Galton board illustrates the normal, or Gaussian, distribution.

Conclusiones

  1. A single path is hard to predict.
  2. Many outcomes can exhibit a stable pattern.
  3. The Galton board illustrates the normal distribution.
TEXTO COMPLETO

Lee el texto editado por capítulos

Solo la transcripción
01

A board that demonstrates probability

The short introduction connects random paths to the bell curve.

A Galton board demonstrates how an individual event can be chaotic and difficult to predict. Each path is uncertain, but the outcomes can still be studied together.

Across many events, relative frequencies can form a regular pattern. The board illustrates the normal distribution, also called the Gaussian distribution or bell curve.

Más de este canal

20 diapositivas40:44EN
3Blue1Brown· 16 oct 2026Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.MathematicsAI for scienceHuman-AI Collaboration+2
29 diapositivas51:55EN
3Blue1Brown· 18 sept 2026The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 24 jul 2026The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
33:51EN
3Blue1Brown· 16 jul 2026What Cross-Entropy Connects: Compression, Language Models and KL DivergenceGrant Sanderson · 3Blue1BrownGrant Sanderson builds cross-entropy from code lengths and uses it to explain next-token training and distillation.MathematicsMachine LearningFoundation Models+1
Diapositivas2:25EN
3Blue1Brown· 12 jun 2026How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.MathematicsAI History
Diapositivas1:02EN
3Blue1Brown· 10 jun 2026A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?MathematicsScience Communication