|
|
A090576
|
|
Number of configurations of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at mid-side of one of the 12 edges of the combination cube.
|
|
6
|
|
|
1, 4, 12, 40, 128, 412, 1251, 4026, 12362, 39624, 120012, 379132, 1130914, 3530916, 10402781, 32112656, 93427431
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(1)=4 because the empty space located at mid-edge of one of the 12 edges of the assumed initial configuration can be replaced in the first move by any of the adjacent 2 cubes from the same edge or by the adjacent mid-face cubes of the 2 faces forming this edge.
|
|
PROG
|
moves = lambda p, shape: moves3d(p, shape)
start, shape = "1-23456789ABCDEFGHIJKLMNOPQ", (3, 3, 3)
|
|
CROSSREFS
|
|
|
KEYWORD
|
fini,hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|