WEBVTT

00:00:00.600 --> 00:00:08.095 line:0
Write the corners of a cube in 0s and 1s; two corners that differ in one place share an edge.

00:00:09.500 --> 00:00:12.544 line:0
A snake walks along the edges, changing one place at each step.

00:00:13.044 --> 00:00:19.110 line:0
It may not touch itself: no two corners of its path that are not next to each other may share an edge.

00:00:19.610 --> 00:00:25.514 line:0
The 4-cube has 16 corners; its longest snake has only 7 edges.

00:00:27.700 --> 00:00:31.289 line:0
The problem comes from the error-checking codes of 1958.

00:00:31.889 --> 00:00:38.155 line:0
Higher up, exhaustive search gives out: the longest snake is proved only up to 8 dimensions.

00:00:38.755 --> 00:00:46.068 line:0
When the run began, the longest public snake in 15 dimensions had 11,673 edges.
