A comprehensive framework for the snake-in-the-box problem
Taylor, Christopher Allen
MetadataShow full item record
The snake-in-the-box problem was posed by Kautz  in the context of coding theory in 1958 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 greater than 7 is an open problem and cannot be solved with exhaustive search techniques due to explosiveness of the search space. Many interesting and creative techniques have been used to try to solve this problem, and this thesis continues that tradition by developing a novel computational and visualization framework aimed to speedily facilitate the evaluation of computational heuristic ideas.