|
Search: id:A090034
|
|
|
| A090034 |
|
Number of configurations of the 3 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners. |
|
+0
7
|
|
| 1, 2, 3, 5, 6, 7, 10, 12, 12, 16, 23, 25, 28, 39, 44, 40, 29, 21, 18, 12, 6, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Data from Karlemo and Ostergard. See corresponding link in A087725.
|
|
REFERENCES
|
See A087725.
|
|
LINKS
|
Hugo Pfoertner, Solutions of small n*2 sliding block puzzles.
Takaken, n-Puzzle Page.
Takaken, No. 32 (5 puzzles).
|
|
EXAMPLE
|
Starting with
123
45-
the most distant configuration corresponding to a(21)=1 is
45-
123 (i.e. it takes longest just to swap the two rows).
|
|
PROGRAM
|
See link in A089473.
|
|
CROSSREFS
|
Cf. A087725, A089473, A090033, A090035, A090036, A090163, A090167.
Adjacent sequences: A090031 A090032 A090033 this_sequence A090035 A090036 A090037
Sequence in context: A102830 A031989 A023746 this_sequence A037016 A101323 A030051
|
|
KEYWORD
|
fini,full,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 23 2003
|
|
|
Search completed in 0.002 seconds
|
