A090572 Number of configurations of the 3-dimensional 2 X 2 X 2 sliding cube puzzle that require a minimum of n moves to be reached.
1, 3, 6, 12, 24, 48, 93, 180, 351, 675, 1191, 1963, 3015, 3772, 3732, 2837, 1589, 572, 78, 18
Offset: 0
Examples
a(19) = 18 because 18 of the total 20160 possible configurations cannot be reached in fewer than 19 single-cube moves.
Links
- Jaap's Puzzle Page: Varikon Box 2 X 2 X 2.
- Werner Lurker, Dreidimensionales puzzleaehnliches Spielzeug. German Patent 2152360, filed Oct 21 1971
- Hugo Pfoertner, List of the most distant configurations for the 2X2X2 sliding cube puzzle.
- Ad van der Schagt, The History of Sliding Block puzzles before Peter's Black Hole.
Crossrefs
Programs
-
Python
# uses alst(), swap() in A089473, moves3d() in A090573 moves = lambda p, shape: moves3d(p, shape) print(alst("-1234567", (2, 2, 2))) # Michael S. Branicky, Dec 31 2020
Comments