From: morten nesje
Subject: 8-puzzle problem
Date: Thu, 07 Nov 1996 00:00:00 +0000
Message-ID: <32827B2E.578@stud.ntnu.no>

I'm a student who is going to solve the famous 8-puzzle-problem.
To solve this problem, we are using a A*-algoritm (or
best-first-search).
To solve this in an efficent way, we need a good heuristic function
which
estimate the number of moves from a given board to the solution. Is
there
anyone out there who has solved this problem, and can help me with the
heuristic function ?

From: John L. Stein
Subject: Re: 8-puzzle problem
Date: Thu, 07 Nov 1996 00:00:00 +0000
Message-ID: <55tl5c$fqs@uni.library.ucla.edu>

I haven't but would be glad to help.

-js