|
Search: id:A079761
|
|
|
| A079761 |
|
Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle. |
|
+0
1
|
|
| 1, 9, 54, 321, 1847, 9992, 50136, 227536, 870072, 1887748, 623800, 2644
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves.
A puzzle in the Rubik cube family. The total number of distinct positions is 3674160. A half-turn is considered to be one move.
|
|
REFERENCES
|
D. R. Hofstadter, Metamagical Themas, Basic Books, NY, 1985, p. 359.
|
|
LINKS
|
Mark Longridge, God's Algorithm Calculations for Rubik's Cube...
Jaap Scherphuis, Puzzle Pages
|
|
CROSSREFS
|
Adjacent sequences: A079758 A079759 A079760 this_sequence A079762 A079763 A079764
Sequence in context: A022637 A001392 A079764 this_sequence A115784 A037599 A037704
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
njas, Feb 20 2003
|
|
|
Search completed in 0.002 seconds
|
