The Snake-in-the-Box problem

Authors:
K. J. Krafka;W. D. Potter;T. R. Horton
Affiliations:
The University of Georgia, Athens, Georgia;The University of Georgia, Athens, Georgia;The University of Georgia, Athens, Georgia
Venue:
Proceedings of the 48th Annual Southeast Regional Conference
Year:
2010

Citing 6
Cited 0

Snakes and pseudo-snakes in powers of complete graphs

Discrete Mathematics
On the snake in the box problem

Journal of Combinatorial Theory Series A
Further results on snakes in powers of complete graphs

Discrete Mathematics
Using the genetic algorithm to find snake-in-the-box codes

IEA/AIE '94 Proceedings of the 7th international conference on Industrial and engineering applications of artificial intelligence and expert systems
A Method for Constructing Circuit Codes

Journal of the ACM (JACM)
Some new circuit codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Snake-in-the-Box problem finds its roots in graph theory and computer science with applications in electrical engineering, coding theory, analog-to-digital conversion, disjunctive normal form simplification, electronic combination locking, and computer network topologies. This fascinating problem has puzzled scholars for over 50 years, but research has produced steady progress. Here, we provide an overview of the problem, its history, and current research, including a potential solution.