xkcd: Snake-in-the-Box Problem

An xkcd comic exploring the snake-in-the-box problem, a classic computer science challenge involving finding the longest possible path through a hypercube graph without revisiting vertices. The problem combines graph theory, combinatorial optimization, and algorithmic thinking in an accessible visual format.