 According to Sawada and Wong, the search space for "n" = 6 can be explored in 15 hours, and more than 9,500 solutions for the case "n" = 7 have been found.Snake-in-the-box codes, or "snakes", are the sequences of nodes of induced paths in an "n"-dimensional hypercube graph, and coil-in-the-box codes, or "coils", are the sequences of nodes of induced cycles in a hypercube.Viewed as Gray codes, these sequences have the property of being able to detect any single-bit coding error.