Priming Snake-in-the-Box Search with Seed Snakes in n-1 and n-2 Dimensions

The Snake-in-the-Box problem seeks the longest possible induced path ("snake") in the edge graph of an n-dimensional hypercube. The best results known in hypercubes of dimension 10 or higher come from extending lower-dimensional seed snakes. This paper describes multiple methods for primed (seeded) search and presents potentially new record lengths of 1461 and 2892 for snakes in 12 and 13 dimensions, respectively.

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average