This is an old revision of the document!
There have been publications on the snake-in-the-box problem for over 50 years now. This page provides you with almost all the major references available, including the first paper ever, on this problem.
Adelson, L.E., Alter, R.,and Curtz, T.B., "Long snakes and a characterization of maximal snakes on the d-cube"
, in the Proceedings of 4th SouthEastern Conference on Combinatorics, Graph Theory and Computing
, Congr. Numer. 8, pp 111-124, 1973.
Black W. L., "Electronic combination locks"
, Quart. Progress Report of the Research Laboratory of Electronics
, No. 73, Massachusetts Institute of Technology, Cambridge, Massachusetts, pp 232-233, April, 1964.
Blass, U., Honkala, I., Karpovsky, M., and Litsyn, S., "Short dominating paths and cycles in the binary hypercube"
, Ann. Combin
, Vol. 5, pp 51–59, 2001.
Carlson, B.P., and Hougen D., "Phenotype Feedback Genetic Algorithm Operators for Heuristic Encoding of Snakes and Hypercubes"
, in the Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation
, GECCO '10, pp 791-798, Portland, Oregon, USA, July 07 - 11, 2010.
Casella, D.A., and Potter, W.D., "New Lower Bounds for the Coil-In-The-Box Problem: Using Evolutionary Techniques to Hunt for Coils"
, in the Proceedings of the International Conference on Computational Intelligence, Man-Machine Systems, and Cybernetics
, CIMMACS’05, CD Proceedings Paper No. 501-111, Miami, Florida, November 17-19, 2005.
Casella, D.A., and Potter, W.D., "Using Evolutionary Techniques to Hunt for Snakes and Coils"
, in the Proceedings of 2005 IEEE Congress on Evolutionary Computing
, CEC’05, pp 2499-2505, Edinburgh, Scotland, September 2-5, 2005.
Casella, D.A., and Potter, W.D., "New Lower Bounds for the Snake-In-The-Box Problem: Using Evolutionary Techniques to Hunt for Snakes"
, in Proceedings of the 18th International FLAIRS Conference
, pp 264-269, Clearwater Beach, Florida, May, 2005.
Chebiryak, Y., Kroening, D, "An efficient SAT encoding of circuit snakes"
, in Proceedings of IEEE International Symposium on Information Theory and its Applications
, Auckland, New Zealand, pp 1235–1238, December 7-10, 2008.
Chebiryak, Y., Wahl, T., Kroening, D., and Haller, L., "Finding Lean Induced Cycles in Binary Hypercubes"
, in Proceedings of SAT Conference
, Lecture Notes in Computer Science no. 5584, Springer Verlag, pp 18-31, June, 2009.
Chien, R.T., Freiman, C.V., and Tang, D.T., "Error connection and circuits on the n-cube"
, in the Proceedings of the 2nd Allerton Conference on Circuit and System Theory
, Univ of Illinois, Monitcello, Illinois, pp 899-912, September 28-30, 1964.
Diaz-Gomez, P., and Hougen, D., "Genetic algorithms for hunting snakes in hypercubes: fitness function analysis and open questions"
, in Seventh ACIS Intern Conf on Softw Eng, Artif Intell, Netw, and Parallel/Distrib Comput (SNPD’06)
. IEEE, Computer Society, Los Alamitos CA, pp 389-394, 2006.
Diaz-Gomez, P., and Hougen, D., "The snake in the box problem: Mathematical Conjecture and a Genetic Algorithm Approach"
, In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation
(Seattle, Washington, USA, July 08 - 12, 2006). GECCO '06. ACM, New York, NY, pp 1409-1410.
Even, S., "Snake in the Box Codes"
, correspondence in IRE Transactions on Electronic Computers
, Vol. EC-12, p. 18, 1963.
Harary, F., Hayes, J.P., and Wu, H.J., "A survey of the theory of hypercube graphs"
, Comput. Math. Applic.
, Vol. 15, pp 277-289, 1988.
Haryanto, L., and van Zanten, A.J., "Snake-in-the-box codes and Euclidean Geometries"
, in Proceedings of the Ninth International Workshop ACCT
, Kranevo, Bulgaria, pp 208–213, June, 2004.
Juric, M., Potter, W.D., and Plaksin, M., "Using PVM for Hunting Snake In The Box Codes"
, Proceedings of the 1994 Transputer Research and Applications Conference (NATUG-7)
, pp 97-102, Athens, GA, October, 1994.
Palani, A., and Potter, W.D., “Hypercube Snake-In-The-Box Exploration Using Level Representation”, in the Proceedings of the 18th IMACS World Congress on Computational and Applied Mathematics & Applications in Science and Engineering, Athens, Georgia, August, 2009 (to appear).
Paterson, K.G. and Tuliani, J., "Some New Circuit Codes"
, IEEE Transactions on Information Theory
, Vol. 44(3), pp 1305-1309, 1998.
Potter, W.D., Robinson R.W., Miller J.A., and Kochut, K.J., "Using the Genetic Algorithm to Find Snake- In-The-Box Codes"
, In Proceeding of the 7th International Conference on Industrial & Engineering Applications of Artificial Intelligence and Expert Systems
, pp 421-426. Austin, Texas, 1994.
Tuohy D.R., Potter, W.D., and Casella, D.A., "Searching for snake-in-the-box codes with evolved pruning models"
, In: Arabnia HR, Yang JY, Yang MQ (eds) Proc 2007 Int Conf Genet and Evol Methods
(GEM’2007). CSREA Press, pp 3-9, 2007.
Wang, L., and Potter, W.D., “SIB Code Search Based on Temporal Difference Learning”, in the Proceedings of the 18th IMACS World Congress on Computational and Applied Mathematics & Applications in Science and Engineering, Athens, Georgia, August, 2009 (to appear).
Wong, C., and Sawada, J.,"Exhaustive Search for Maximal Length Coil-In-The-Box Codes"
, University of Guelph Technical Report
(TR-UG-CIS-2008-001), Guelph, Ontario, Canada, June, 2008.
van Zanten, A.J., and Haryanto, L., "Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube"
, in Designs, Codes, and Cryptography
, Vol. 48, pp 207-229, 2008.
van Zanten, A.J., and Lukito, A., "Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics"
, Designs, Codes, and Cryptography
, Vol. 16 (2), pp 185-199, 1999.
Zinovik, I., Chebiryak, Y., and Kroening, D.,"Periodic Orbits and Equilibria in Glass Models for Gene Regulatory Networks"
, IEEE Transactions on Information Theory
, Vol. 56 (2), p. 805-820, February, 2010.