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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Goldreich, O. (2011). Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 1–5. https://doi.org/10.1007/978-3-642-22670-0_1
Mendeley helps you to discover research relevant for your work.