#3125: Snake-in-the-Box Problem
Permalink
Transcript
![]() |
This is one of 43 incomplete transcripts: Don't remove this notice too soon. If you can fix this issue, edit the page! |
[A panel with text both above and below the illustration, with further text outside the panel.]
[In the panel, above the illustration:]
A snake slithers around a hypercube. No two non-consecutive parts of its coils can be on adjacent corners.
[Three small illustrations of 4-dimensional hypercubes, each with a snake slithering around its edges. Each illustration has a red line or lines indicating an edge or edges where two non-consecutive parts of the snake are on adjacent corners. Below each hypercube is a red X.]
[A large illustration depicting a 4-dimensional hypercube with a snake slithering around its edges.]
[Below the large illustration is text printed in green. To the left of the text is a green checkmark.]
Dimensions=4
Max length=7
[The following text is printed in black:]
Snake(N) = Largest snake that can fit in an N-dimensional hypercube
(Sourced from explainxkcd.com)
Title text:Chemistry grad students have been spotted trying to lure campus squirrels into laundry hampers in the hope that it sparks inspiration.