cp's OEIS Frontend

A090574 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 in the center of the combination cube.

%I A090574 #9 Dec 29 2020 06:32:14
%S A090574 1,6,24,72,192,624,2004,6504,19776,62760,186000,583712,1720972,
%T A090574 5344088,15565416,47816092,137916958
%N A090574 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 in the center of the combination cube.
%C A090574 See under A090573.
%e A090574 a(1)=6 because the empty space in the center of the cube present in the assumed initial configuration can be replaced by any of the 6 adjacent cubes from the face centers in the first move.
%o A090574 (Python) # uses alst(), swap() in A089473, moves3d() in A090573
%o A090574 moves = lambda p, shape: moves3d(p, shape)
%o A090574 start, shape = "123456789ABCD-EFGHIJKLMNOPQ", (3, 3, 3)
%o A090574 print(alst(start, shape, maxd=12)) # _Michael S. Branicky_, Dec 28 2020
%Y A090574 A090572 2 X 2 X 2 puzzle, A090573, A090575, A090576 3 X 3 X 3 puzzle with different initial configurations.
%K A090574 fini,hard,more,nonn
%O A090574 0,2
%A A090574 _Hugo Pfoertner_, Jan 15 2004
%E A090574 a(13)-a(16) from _Michael S. Branicky_, Dec 28 2020