|
Search: id:A090035
|
|
|
| A090035 |
|
Number of configurations of the 4 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
6
|
|
| 1, 2, 3, 6, 10, 14, 19, 28, 42, 61, 85, 119, 161, 215, 293, 396, 506, 632, 788, 985, 1194, 1414, 1664, 1884, 1999, 1958, 1770, 1463, 1076, 667, 361, 190, 88, 39, 19, 7, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Data from Karlemo, 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. 42 (7 puzzles).
|
|
EXAMPLE
|
Starting from
1234
567-
the most distant configuration corresponding to a(36)=1 is
-765
3412
|
|
PROGRAM
|
Program: See link in A089473.
|
|
CROSSREFS
|
Cf. A087725, A089473. Index of last sequence term: A090033. Other non-square sliding block puzzles: A090034, A090036, A090166, A090167.
Sequence in context: A120754 A023547 A084396 this_sequence A111467 A102366 A074134
Adjacent sequences: A090032 A090033 A090034 this_sequence A090036 A090037 A090038
|
|
KEYWORD
|
fini,full,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 26 2003
|
|
|
Search completed in 0.002 seconds
|
