Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!wuarchive!uunet!mcsun!ukc!icdoc!qmw-cs!mmh
From: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Newsgroups: comp.ai
Subject: Re: 15-puzzle
Message-ID: <2929@sequent.cs.qmw.ac.uk>
Date: 10 Oct 90 16:58:34 GMT
References: <1491@meaddata.meaddata.com> <20930@well.sf.ca.us> <46717@cornell.UUCP>
Distribution: comp
Organization: Computer Science Dept, QMW, University of London, UK.
Lines: 11
Summary:
Expires:
Sender:
Followup-To:
Keywords:

In article <46717@cornell.UUCP> houpt@svax.cs.cornell.edu (Charles E. Houpt) writes:
>
>   One method commonly used by humans to solve the 8 puzzle (and the 15
>puzzle) is the Round-About or Merry-Go-Round method.

All these methods involving macro-operators and subgoals are
not guaranteed to give the optimal solution. If you want the
least number of moves to reach the goal you must still employ the
standard search techniques.

Matthew Huntbach