A090032 Number of configurations of the 6 X 6 variant of Sam Loyd's sliding block 15-puzzle ("35-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.

1, 2, 4, 10, 26, 66, 171, 440, 1112, 2786, 6820, 16720, 41106, 100856, 245793, 597030, 1441292, 3469486, 8304526, 19832076, 47110238, 111669014

Offset: 0

Author

Hugo Pfoertner, Nov 25 2003

Keywords

• fini
• hard
• more
• nonn

References

• See A087725.

Links

• Hugo Pfoertner, Configuration counts for n*n sliding block puzzles.

Crossrefs

Cf. A087725, A089473, A089484, A090031.

Programs

Python

# uses alst(), swap() in A089473
start, shape = "-123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", (6, 6)
print(alst(start, shape, maxd=16)) # Michael S. Branicky, Jan 02 2021

Extensions

a(17)-a(21) from Michael S. Branicky, Dec 28 2020