Pruning the search space for the snake-in-the-box problem

Authors:
J. D. Griffin;W. D. Potter
Affiliations:
Institute for Artificial Intelligence, GSRC, University of Georgia, Athens, Georgia;Institute for Artificial Intelligence, GSRC, University of Georgia, Athens, Georgia
Venue:
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Year:
2010

Citing 2
Cited 0

Using the genetic algorithm to find snake-in-the-box codes

IEA/AIE '94 Proceedings of the 7th international conference on Industrial and engineering applications of artificial intelligence and expert systems
A Method for Constructing Circuit Codes

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores methods for reducing the search space when hunting for snakes using a Genetic Algorithm (GA). The first method attempts to reinterpret individuals in an effort to utilize the high degree of symmetry inherent in the problem and, thereby, make crossover more effective. The second method centers around removing snake blockers, which are sequences that prevent snakes, and the effects of snake blockers on the search space and GA effectiveness. Testing of these methods is limited to dimension 8; however, the concepts are applicable to all dimensions.