A comprehensive framework for the snake-in-the-box problem

The snake-in-the-box problem was posed by Kautz [5] in the context of coding theory in1958 and is essentially the problem of finding the longest path in an n-dimensional hyper-cube subject to a simple set of constraints. Finding the longest path for dimensions greaterthan 7 is an open problem and cannot be solved with exhaustive search techniques due toexplosiveness of the search space. Many interesting and creative techniques have been usedto try to solve this problem, and this thesis continues that tradition by developing a novelcomputational and visualization framework aimed to speedily facilitate the evaluation ofcomputational heuristic ideas.