Searching for Snake-In-The-Box Codes With Evolved Pruning Models

We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evolutionary algorithm. These snakes are then analyzed to define a pruning model that constrains the search space. A depth-first search of the constrained solution space has established new lower bounds for the length of the longest snakes in the 9 and 10 dimensional hypercube graphs.

• Type: Conference
• Year: 2007
• Where: GEM
• Authors: Daniel R. Tuohy, Walter D. Potter, Darren A. Casella
• Keywords: Artificial Intelligence, Exemplary Snakes, GEM 2007, Hypercube Graphs, Technique first Obtains