Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard

Authors:
Oded Goldreich
Affiliations:
Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Israel
Venue:
Studies in complexity and cryptography
Year:
2011

Citing 2
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Push and rotate: cooperative multi-agent path planning

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems

Quantified Score

Hi-index	0.00

Visualization

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.