Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089483
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089483 Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side. +0
4
1, 3, 5, 10, 14, 28, 42, 80, 108, 202, 278, 524, 726, 1348, 1804, 3283, 4193, 7322, 8596, 13930, 14713, 21721, 19827, 25132, 18197, 18978, 9929, 7359, 2081, 878, 126, 2 (list; graph; listen)
OFFSET

0,2

REFERENCES

See A087725.

LINKS

Hugo Pfoertner, Table of solution lengths of the 8-puzzle

EXAMPLE

Starting with

1-2

345

678

the two final configurations requiring 31 moves are

86- ... -86

547 and 743

231 ... 251

MAPLE

See link in A089473.

CROSSREFS

Cf. A089473, A089474, A089484, A087725, A090031.

Sequence in context: A078411 A137630 A092269 this_sequence A023602 A024452 A074968

Adjacent sequences: A089480 A089481 A089482 this_sequence A089484 A089485 A089486

KEYWORD

fini,full,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 19 2003

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research