Technical Report CS0792

TR#:CS0792
Class:CS
Title: FINDING THE SHORTEST MOVE-SEQUENCE IN THE GRAPH-GENERALIZED 15-PUZZLE IS NP-HARD.
Authors: O. Goldreich
PDFNot Available
Abstract:

Following Wilson, Johnson and Kornhauser, Miller and Spirakis, we consider the following one-party game. The game consists of moving distinct pebbles along the edges of an undirected graph. At most one pebble may be present in each vertex at all time. It is only allowed to move one pebble at a time (clearly it must be moved to a previously empty vertex). We show that the problem of finding the shortest sequence of moves from one ``graph configuration'' to another is NP-Hard.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1993/CS/CS0792), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1993
To the main CS technical reports page

Computer science department, Technion
admin