|
|
A090163
|
|
Triangle T(j,k) read by rows, where T(j,K)=number of different configurations having the largest required number of moves S(j,k)=A090033(n) in optimal solutions of the j X k generalization of Sam Loyd's sliding block 15-puzzle, starting with the empty square in a corner.
|
|
2
|
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
T(k,j)=T(j,k). Extension: a(10)=T(4,4)>=13, a(11)=T(5,1)=1, a(12)=T(5,2)=2.
|
|
LINKS
|
|
|
EXAMPLE
|
a(5)=T(3,2)=1 because the 3*2 sliding block puzzle has only one configuration requiring the maximum solution path length A090033(5)=21.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|