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

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

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 proceeding › Conference contribution › peer-review

10 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 language	English
Title of host publication	Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Editors	Levi Lelis, Roni Stern
Publisher	AAAI press
Pages	96-104
Number of pages	9
ISBN (Electronic)	9781577357322
State	Published - 2015
Externally published	Yes
Event	8th Annual Symposium on Combinatorial Search, SoCS 2015 - Ein Gedi, Israel Duration: 11 Jun 2015 → 13 Jun 2015

Publication series

Name	Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Volume	2015-January

Conference

Conference	8th Annual Symposium on Combinatorial Search, SoCS 2015
Country/Territory	Israel
City	Ein Gedi
Period	11/06/15 → 13/06/15

Bibliographical note

Publisher Copyright:
Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This research was supported by the Israel Science Foundation (ISF) under grant #417/13 to Ariel Felner and by the US NSF under grant #1150068 to Wheeler Ruml.

Funders	Funder number
National Science Foundation	1150068
Israel Science Foundation	417/13

Cite this

Palombo, A., Stern, R., Puzis, R., Felner, A., Kiesel, S., & Ruml, W. (2015). Solving the snake in the box problem with heuristic search: First results. In L. Lelis, & R. Stern (Eds.), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015 (pp. 96-104). (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January). AAAI press.

@inproceedings{aa5269db3055458399e7f2b37bd03cde,

title = "Solving the snake in the box problem with heuristic search: First results",

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.",

author = "Alon Palombo and Roni Stern and Rami Puzis and Ariel Felner and Scott Kiesel and Wheeler Ruml",

note = "Publisher Copyright: Copyright {\textcopyright} 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 8th Annual Symposium on Combinatorial Search, SoCS 2015 ; Conference date: 11-06-2015 Through 13-06-2015",

year = "2015",

language = "אנגלית",

series = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

publisher = "AAAI press",

pages = "96--104",

editor = "Levi Lelis and Roni Stern",

booktitle = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

}

Palombo, A, Stern, R, Puzis, R, Felner, A, Kiesel, S & Ruml, W 2015, Solving the snake in the box problem with heuristic search: First results. in L Lelis & R Stern (eds), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015, vol. 2015-January, AAAI press, pp. 96-104, 8th Annual Symposium on Combinatorial Search, SoCS 2015, Ein Gedi, Israel, 11/06/15.

Solving the snake in the box problem with heuristic search: First results. / Palombo, Alon; Stern, Roni; Puzis, Rami et al.
Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. ed. / Levi Lelis; Roni Stern. AAAI press, 2015. p. 96-104 (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Solving the snake in the box problem with heuristic search

T2 - 8th Annual Symposium on Combinatorial Search, SoCS 2015

AU - Palombo, Alon

AU - Stern, Roni

AU - Puzis, Rami

AU - Felner, Ariel

AU - Kiesel, Scott

AU - Ruml, Wheeler

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84988633192&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84988633192

T3 - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

SP - 96

EP - 104

BT - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

A2 - Lelis, Levi

A2 - Stern, Roni

PB - AAAI press

Y2 - 11 June 2015 through 13 June 2015

ER -

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

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this