Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, p. 221. Freeman, San Francisco (1979)
Johnson, D.S.: The NP-Completeness Column: An Ongoing Guide. J. of Algorithms 4, 397–411 (1983)
Kornhauser, D.M., Miller, G., Spirakis, P.: Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications. In: Proc. of the 25th FOCS, pp. 241–250 (1984)
Wilson, R.W.: Graphs, Puzzles, Homotopy, and Alternating Groups. J. of Comb. Th. (B) 16, 86–96 (1974)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goldreich, O. (2011). Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard. In: Goldreich, O. (eds) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science, vol 6650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-22670-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22669-4
Online ISBN: 978-3-642-22670-0
eBook Packages: Computer ScienceComputer Science (R0)