Date of Award
4-19-2024
Document Type
Honors Thesis
Department
Mathematics
First Advisor
Anthony Bosman
Abstract
A snake cube is a puzzle made by a sequence of n3 straight and turn pieces that can fold into a n x n x n cube. Solving the puzzle is comparable to the problem of finding a Hamiltonian path in the grid graph of the cube. By using computer algorithms, we find and count all sequences that are solutions. Furthermore, we can count the unique folding configurations of each sequence giving us an idea of its difficulty. Finally, we expand on this by exploring the problem in other topological variants of the cube, which sheds insight into the problem as we compare results from the different variants.
Recommended Citation
Shepard, Jamie, "Solvability and Difficulty of the Snake Puzzle in the Cube and its Topological Variants" (2024). Honors Theses. 290.
https://digitalcommons.andrews.edu/honors/290
Subject Area
Puzzles, Mathematical recreations
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Files over 3MB may be slow to open. For best results, right-click and select "save as..."