Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news4.ner.bbnplanet.net!news.ner.bbnplanet.net!news.mathworks.com!newsfeed.internetmci.com!EU.net!sun4nl!aie.nl!news
From: geert@michelv.aie.nl (Geert-Jan van Opdorp)
Subject: Re: Sliding Tile Game Solver
Sender: news@aie.nl (Usenet News)
Message-ID: <GEERT.96Mar25181939@michelv.aie.nl>
In-Reply-To: smokeserpent@valleynet.com's message of 23 Mar 1996 10:49:44 GMT
Date: Mon, 25 Mar 1996 17:19:37 GMT
Lines: 31
X-Nntp-Posting-Host: michelv.aie.nl
References: <Pine.SGI.3.91.960315223936.19151A-100000@skule.ecf>
	<4j0l08$rh7@alpine.valleynet.com>
Organization: AI Engineering BV

>>>>> "Benjamin" == Benjamin  <smokeserpent@valleynet.com> writes:
In article <4j0l08$rh7@alpine.valleynet.com> smokeserpent@valleynet.com (Benjamin) writes:


Benjamin> I am not sure, but it seems to me that there is a set of
Benjamin> rules for solving these 'sliding tile' things without
Benjamin> resorting to AI. I do not remember where or when or if I
Benjamin> actually read such, but when I find myself solving one, I
Benjamin> feel an awareness that I am somehow following a rigorous
Benjamin> approach, though I have never sat down to try to isolate
Benjamin> exactly what it is.  -- Benjamin


No doubt there are cheaper ways to find just any
solution, but the for finding the shortest solution
A* seems apropriate. The sliding puzzle is a
classical introduction to A*, isn't it? The original
poster might be looking for help with his homework, so
perhaps I shouldn't, but ok, here is a Java implementation
of A* and a sliding puzzle:

http://www.aie.nl/~geert/java/public/EightPuzzle.html

Geert-Jan


-- 
Geert-Jan van Opdorp
AI-Engineering
Amsterdam, The Netherlands
geert@aie.nl
