The snake-in-the-box problem is a difficult problem in mathematics and computer science that was first described by Kautz in the late 1950â€™s (Kautz 1958). Snake-in-the-box codes have manyâ€¦ (More)

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.â€¦ (More)

The snake-in-the-box problem is a difficult problem in mathematics and computer science that deals with finding the longest-possible constrained path that can be formed by following the edges of aâ€¦ (More)

The coil-in-the-box problem is a variation of a difficult problem in mathematics and computer science, known as the snake-in-the-box problem, that was first described by Kautz in the late 1950â€™s [7].â€¦ (More)

We present a method for searching for simple achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains exemplary snakes using an evolutionary algorithmâ€¦ (More)