|
Search: id:A090033
|
|
|
| A090033 |
|
Triangle T(j,k) read by rows, where T(j,K)=number of single tile moves in the longest optimal solution of the j X k generalization of Sam Loyd's sliding block 15-puzzle, starting with the empty square in a corner. |
|
+0
7
|
|
| 0, 1, 6, 2, 21, 31, 3, 36, 53, 80, 4, 55
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Comment: T(k,j)=T(j,k). T(2,2), T(2,3), T(4,2), T(4,3) from Karlemo and Ostergard, T(3,3) from Reinefeld, T(4,4) from Bruengger et al.
|
|
REFERENCES
|
For references and links see A087725(n)=T(n,n).
|
|
EXAMPLE
|
a(6)=T(3,3)=31 because the A090163(3,3)=2 longest optimal solution paths of the 3 X 3 (9-) sliding block puzzle have length 31 (see A089473).
|
|
CROSSREFS
|
Cf. A087725, A089473, A089484, A090034, A090035, A090036, A090166, A090163 corresponding number of different configurations with largest distance.
Sequence in context: A136398 A081778 A055943 this_sequence A036173 A142707 A084249
Adjacent sequences: A090030 A090031 A090032 this_sequence A090034 A090035 A090036
|
|
KEYWORD
|
hard,more,nonn,tabl
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 23 2003
|
|
|
Search completed in 0.002 seconds
|
