Sliding puzzle problem

Article View: comp.lang.modula2

Article #1922

#1922

From: 2hnemarrow
Date: Thu, 11 Apr 1991 22:43

14 lines
895 bytes

I was just sitting here and wondering if someone might know what the worst case
and maximum number of moves it takes for a 3X3 sliding tile puzzle.  I'd like
to know for a modulae 2 progarm I'm writing <-- (duh). 

 _________________
|     |     |     |
|  1  |  2  |  3  |
|_____|_____|_____|     E-mail would be best, I think.  Thanks in advance,
|     |     |     |
|  4  |  5  |  6  |
|_____|_____|_____|     2hnemarrow@kuhub.cc.ukans.edu
|     |     |     |
|  7  |  8  |  9  |
|_____|_____|_____|

Technical Details

Message-ID: <1991Apr11.174331.29638@kuhub.cc.ukans.edu>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!caen!kuhub.cc.ukans.edu!2hnemarrow

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!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.lang.modula2
Subject: Sliding puzzle problem
Message-ID: <1991Apr11.174331.29638@kuhub.cc.ukans.edu>
Date: 11 Apr 91 17:43:31 CDT
Organization: University of Kansas Academic Computing Services
Lines: 14