Snake-in-the-box problem
What is the longest path along the edges of an n-dimensional cube that never comes next to a corner it visited earlier, other than the one it just left?
Summary
William Kautz first described the problem in 1958, motivated by error-correcting codes: the corners of such a path form a Gray code that detects single-bit errors. The longest length is known only for dimensions one to eight; beyond that only the best lengths found by searches and general upper bounds are known.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.