TY - CHAP
T1 - Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
AU - Goldreich, Oded
PY - 2011
Y1 - 2011
N2 - Following Wilson (J. Comb. Th. (B), 1975), Johnson (J. of Alg., 1983), and Kornhauser, Miller and Spirakis (25th FOCS, 1984), we consider a game that consists of moving distinct pebbles along the edges of an undirected graph. At most one pebble may reside in each vertex at any time, and it is only allowed to move one pebble at a time (which means that the pebble must be moved to a previously empty vertex). We show that the problem of finding the shortest sequence of moves between two given "pebble configuations" is NP-Hard.
AB - Following Wilson (J. Comb. Th. (B), 1975), Johnson (J. of Alg., 1983), and Kornhauser, Miller and Spirakis (25th FOCS, 1984), we consider a game that consists of moving distinct pebbles along the edges of an undirected graph. At most one pebble may reside in each vertex at any time, and it is only allowed to move one pebble at a time (which means that the pebble must be moved to a previously empty vertex). We show that the problem of finding the shortest sequence of moves between two given "pebble configuations" is NP-Hard.
UR - https://www.scopus.com/pages/publications/84857608564
U2 - 10.1007/978-3-642-22670-0_1
DO - 10.1007/978-3-642-22670-0_1
M3 - Chapter
SN - 9783642226694
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 5
BT - Studies in Complexity and Cryptography
A2 - Goldreich, Oded
ER -