Solving the snake in the box problem with heuristic search: First results

Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

Snake in the Box (SIB) is the problem of finding the longest simple path along the edges of an n-dimensional cube, subject to certain constraints. SIB has important applications in coding theory and communications. State of the art algorithms for solving SIB apply uninformed search with symmetry breaking techniques. We formalize this problem as a search problem and propose several admissible heuristics to solve it. Using the proposed heuristics is shown to have a huge impact on the number of nodes expanded and, in some configurations, on runtime. These results encourage further research in using heuristic search to solve SIB, and to solve maximization problems more generally.

Original languageEnglish
Title of host publicationProceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
EditorsLevi Lelis, Roni Stern
PublisherAAAI press
Pages96-104
Number of pages9
ISBN (Electronic)9781577357322
StatePublished - 1 Jan 2015
Event8th Annual Symposium on Combinatorial Search, SoCS 2015 - Ein Gedi, Israel
Duration: 11 Jun 201513 Jun 2015

Publication series

NameProceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Volume2015-January

Conference

Conference8th Annual Symposium on Combinatorial Search, SoCS 2015
Country/TerritoryIsrael
CityEin Gedi
Period11/06/1513/06/15

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Solving the snake in the box problem with heuristic search: First results'. Together they form a unique fingerprint.

Cite this