8-tile puzzle

Article View: comp.lang.prolog

Article #932

#932

From: John Milbury-Steen
Date: Fri, 29 Jun 1990 15:42

19 lines
1083 bytes

Anybody recall a discussion from any AI literature on a
heuristic for deciding which tile to move next in the
8-tile puzzle?  

In this puzzle, there are 9 locations for tiles: 8 actual
tiles, and one empty space.  The tiles are out of order,
and the user has to sort the tiles by repeatedly moving a tile
into the empty space.

Anyone seen a Prolog program that does this? A friend of mine
wants to see what happens when you apply it to a 15-tile puzzle.



-- 
|   John Milbury-Steen   (302)451-2698   jms@sun.acs.udel.edu |
|   Office of Academic Computing and Instructional Technology |
|   University of Delaware                    Newark DE 19716 |
|   "I like to think I have another life."                   |

Technical Details

Message-ID: <12398@sun.udel.edu>

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mailrus!cornell!rochester!udel!udccvax1!sun.udel.edu!jms

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mailrus!cornell!rochester!udel!udccvax1!sun.udel.edu!jms
From: jms@sun.udel.edu (John Milbury-Steen)
Newsgroups: comp.lang.prolog
Subject: 8-tile puzzle
Message-ID: <12398@sun.udel.edu>
Date: 29 Jun 90 15:42:03 GMT
Reply-To: jms@sun.udel.edu (John Milbury-Steen)
Organization: University of Delaware
Lines: 19