Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!caen!kuhub.cc.ukans.edu!2hnemarrow
From: 2hnemarrow@kuhub.cc.ukans.edu
Newsgroups: comp.sys.apple2
Subject: Sliding puzzle problem
Message-ID: <1991Apr11.175025.29639@kuhub.cc.ukans.edu>
Date: 11 Apr 91 17:50:20 CDT
Organization: University of Kansas Academic Computing Services
Lines: 15

Excuse me if this sounds a little unrelated, but I need to know the worst case
and maximum number of moves it takes to solve a 3X3 sliding puzzle, and it
looks something like this:

 _________________
|     |     |     |
|  1  |  2  |  3  |        I need it for a program I am writing.
|_____|_____|_____|        Thanks in advance,
|     |     |     |
|  4  |  5  |  6  |        2hnemarrow@kuhub.cc.ukans.edu
|_____|_____|_____|
|     |     |     |        Watch for HCADgs v2.0
|  7  |  8  |     |        Coming soon to a BBS near you!
|_____|_____|_____|