Finding Longest Paths in Hypercubes: 11 New Lower Bounds for Snakes, Coils, and Symmetrical Coils

Since the problem's formulation by Kautz in 1958 as an error detection tool, diverse applications for long snakes and coils have been found. These include coding theory, electrical engineering, and genetics. Over the years, the problem has been explored by many researchers in different fields using varied approaches, and has taken on additional meaning. The problem has become a benchmark for evaluating search techniques in combinatorially expansive search spaces NP-complete Optimizations. We build on our previous work and present improved heuristics for Stochastic Beam Search sub-solution selection in searching for longest induced paths: open snakes, closed coils, and symmetric closed symmetric coils; in n-dimensional hypercube graphs. Stochastic Beam Search, a non-deterministic variant of Beam Search, provides the overall structure for our search. We present eleven new lower bounds for the Snake-in-the-Box problem for snakes in dimensions 11, 12, and 13; coils in dimensions 10, 11, and 12; and symmetric coils in dimensions 9, 10, 11, 12, and 13. The best known solutions of the unsolved dimensions of this problem have improved over the years and we are proud to make a contribution to this problem as well as the continued progress in combinatorial search techniques.

[1]  David Kinny.  A New Approach to the Snake-In-The-Box Problem , 2012, ECAI.

[2]  Philip Brooks,et al.  Particle Swarm Optimization and priority representation , 2010 .

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Ed Wynn,et al.  Constructing circuit codes by permuting initial sequences , 2012, ArXiv.

[5]  Walter D. Potter,et al.  Using evolutionary techniques to hunt for snakes and coils , 2005, 2005 IEEE Congress on Evolutionary Computation.

[6]  Kenneth G. Paterson,et al.  Single-track circuit codes , 2001, IEEE Trans. Inf. Theory.

[7]  Victor Klee,et al.  What is the Maximum Length of a d-Dimensional Snake? , 1970 .

[8]  Daniel Kroening,et al.  Periodic Orbits and Equilibria in Glass Models for Gene Regulatory Networks , 2010, IEEE Transactions on Information Theory.

[9]  Moshe Schwartz,et al.  Snake-in-the-Box Codes for Rank Modulation , 2011, IEEE Transactions on Information Theory.

[10]  William H. Kautz,et al.  Unit-Distance Error-Checking Codes , 1958, IRE Trans. Electron. Comput..

[11]  Sarit Kraus,et al.  Delegating Decisions in Strategic Settings , 2012, IEEE Transactions on Artificial Intelligence.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  David Kinny.  Monte-Carlo Search for Snakes and Coils , 2012, MIWAI.

[14]  Fan Zhang,et al.  Determination of optimal period of absolute encoders with single track cyclic gray code , 2008 .

[15]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[16]  Walter D. Potter,et al.  Finding longest paths in hypercubes, snakes and coils , 2014, 2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES).

[17]  W. D. Potter,et al.  Forest Planning Using Particle Swarm Optimization with a Priority Representation , 2011, IEA/AIE.

[18]  Walter D. Potter,et al.  Searching for Snake-In-The-Box Codes With Evolved Pruning Models , 2007, GEM.

[19]  Pedro A. Diaz-Gomez,et al.  Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).

[20]  Dean F. Hougen,et al.  Phenotype feedback genetic algorithm operators for heuristic encoding of snakes within hypercubes , 2010, GECCO '10.

[21]  Donald W. Davies,et al.  Longest "Separated" Paths and Loops in an N Cube , 1965, IEEE Trans. Electron. Comput..

[22]  John A. Miller,et al.  Using the genetic algorithm to find snake-in-the-box codes , 1994, IEA/AIE '94.