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 31381059609.
LINKS
Jaap Scherphuis, Puzzle Pages
PROG
(Python) # alst(), moves() in A079873
shape, states = (5, 5), 3 # 5x5 with off-red-green states
start = tuple([0 for i in range(shape[0]*shape[1])])
print(alst(start, shape, states, v=True)) # Michael S. Branicky, Jan 25 2021
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
N. J. A. Sloane, Feb 21 2003
STATUS
approved