30초 요약
3Blue1Brown poses a binary-encoding puzzle about a robot on a distant moon. The challenge is to find the most efficient encoding and prove it optimal, an introduction to Shannon entropy; the short does not provide the solution.
- 1Four directions, unequal frequenciesThe robot follows a biased random walk: up one half, down one quarter, and left and right one eighth each.
- 2Find an efficient codeEncode the instructions in binary while minimizing bits per instruction.
- 3Prove optimalityShow that no other encoding can improve on your answer; the video leaves the proof as a challenge.
핵심 정리
- The robot moves up half the time, down one quarter, and left or right one eighth each.
- The first challenge is to encode the instructions in binary using as few bits per instruction as possible.
- The second is to prove no other encoding can do better, leading toward Shannon entropy.
챕터별로 다듬은 전문 읽기
A robot on a distant moon
The robot can move in four directions with unequal frequencies.
Imagine I have sent a robot to a far-away moon, and we want to send it movement instructions from Earth. Each instruction is simple: step up, down, left or right.
The instructions make the robot follow a biased random walk. Half its movements are up, one quarter are down, and one eighth each are left and right.
The encoding challenge
Find the most efficient binary code and prove that it cannot be beaten.
Here is the two-part puzzle. First, find the most efficient way to encode these instructions in binary, using as few bits per instruction as possible. For challenge mode, prove that your answer really is optimal: no other encoding can do better.
The connection to entropy
The puzzle is a first step toward Shannon entropy; the linked full video explains further.
If you can answer that, you have taken a first step toward reinventing Shannon entropy. The full video, the first in a series on the phrase “compression is intelligence,” explains the details. This short poses the question without giving the solution.
같은 채널의 다른 글
40:44EN
3Blue1Brown· 2026년 10월 16일Grant 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.
51:55EN3Blue1Brown· 2026년 9월 18일The 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.
0:55EN3Blue1Brown· 2026년 7월 24일The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.
2:25EN3Blue1Brown· 2026년 6월 12일How 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.
32:19EN3Blue1Brown· 2026년 6월 7일Reinventing Entropy: Why Prediction Helps Compress LanguageA robot’s movement code leads from prefix-free encoding to Shannon information and the entropy of language.
0:48EN3Blue1Brown· 2026년 3월 25일The Subset Sum Puzzle: Who Has a Winning Strategy?Choose ten integers from 1 to 100, then look for two different subsets with the same sum.