Paper Info
Title
A New Approach to the Snake-In-The-Box Problem.
Abstract
The "Snake-In-The-Box" problem, first described more than 50 years ago, is a hard combinatorial search problem whose solutions have many practical applications. Until recently, techniques based on Evolutionary Computation have been considered the state-of-the-art for solving this deterministic maximization problem, and held most significant records. This paper reviews the problem and prior solution techniques, then presents a new technique, based on Monte-Carlo Tree Search, which finds significantly better solutions than prior techniques, is considerably faster, and requires no tuning.
Year
DOI
Venue
2012
10.3233/978-1-61499-098-7-462
Frontiers in Artificial Intelligence and Applications
Field
DocType
Volume
Mathematical optimization,Computer science,Evolutionary computation,Snake-in-the-box,Artificial intelligence,Combinatorial search,Maximization,Machine learning
Conference
242
ISSN
Citations 
PageRank 
0922-6389
7
0.56
References 
Authors
18
1
Name
Order
Citations
PageRank
David Kinny11940210.96