|
%I #12 Dec 31 2020 02:12:39
%S 1,2,3,5,6,7,10,12,12,16,23,25,28,39,44,40,29,21,18,12,6,1
%N 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.
%C Data from Karlemo and Östergård. See corresponding link in A087725.
%D See A087725.
%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/sbpnx2.txt">Solutions of small n*2 sliding block puzzles.</a>
%H Takaken, <a href="http://www.ic-net.or.jp/home/takaken/nt/slide/index.html">n-Puzzle Page</a>.
%H Takaken, <a href="http://www.ic-net.or.jp/home/takaken/nt/slide/result32.txt">No. 32 (5 puzzles)</a>.
%e Starting with
%e 123
%e 45-
%e the most distant configuration corresponding to a(21)=1 is
%e 45-
%e 123 (i.e., it takes longest just to swap the two rows).
%o See link in A089473.
%o (Python) # alst(), moves(), swap() in A089473
%o print(alst("-12345", (3, 2))) # _Michael S. Branicky_, Dec 30 2020
%Y Cf. A087725, A089473, A090033, A090035, A090036, A090163, A090167.
%K fini,full,nonn
%O 0,2
%A _Hugo Pfoertner_, Nov 23 2003
|
