Archives

A cubic graph with cubic diameter

The Fifteen puzzle is sometimes generalized to a sliding puzzle on an arbitrary simple connected graph G with n vertices in the following way. n − 1 movable pieces numbered 1, 2, ... (n − 1) are placed on vertices of the graph G. At most one piece is placed on each vertex. One vertex of G is left unoccupied. A move consists in choosing a vertex v adjacent to the currently unoccupied vertex v0 and 'sliding' the piece at v along the edge (v; v0). The aim is to restore the order so that piece numbered i occupies vertex numbered i, for i = 1 .. n − 1. In the case of the Fifteen Puzzle, the underlying graph G is the 4 × 4 grid graph, and a degree-2 vertex is left unoccupied in the goal configuration.