OFFSET
0,2
COMMENTS
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
KEYWORD
nonn,fini,full
AUTHOR
N. J. A. Sloane, Feb 20 2003
STATUS
approved