A346737 - OEIS

A346737

Number of configurations of the 5 X 3 variant of the sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.

1, 2, 4, 9, 21, 42, 89, 164, 349, 644, 1349, 2473, 5109, 9110, 18489, 32321, 64962, 112445, 223153, 378761, 740095, 1231589, 2364342, 3847629, 7246578, 11506172, 21233764, 32854049, 59293970, 89146163, 157015152, 228894783, 392648931, 553489877, 922382155

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

This sequence was originally computed by Richard Korf, but the full sequence was not included in his paper. It was later re-computed by Tomas Rokicki.

LINKS

Ben Whitmore, Table of n, a(n) for n = 0..84

Richard Korf, Linear-time Disk-Based Implicit Graph Search, Journal of the ACM 55 (2008), No. 6.

Tomas Rokicki, Twenty-Four puzzle, some observations, 2011.

EXAMPLE

Starting from the solved configuration

1 2 3 4 5

6 7 8 9 10

11 12 13 14

the unique configuration requiring 84 moves is

5 4 3 2 1

10 9 8 7 6