Sliding Tile Puzzle Solver 
Copyright C. A. Broadribb 1996 
Completed 27/9/96 

This program solves a sliding tile puzzle of eight numbered squares
and one blank square.  The puzzle was devised by Sam Loyd. 

When you run the program you will be asked to enter the correct 
configuration for the puzzle by typing in three lines of three
numbers each, using 0 to represent the blank square.  Then you
will be asked to enter the current configuration.  The program 
will work out which tiles to move in which order to solve the 
puzzle.  E.g. for the correct configuration you could enter:
123
804
765

and for the current configuration you could enter:
283
164
705

Note that the program may run out of memory if given a very complicated 
configuration.  

It can be compiled in UNIX (if you change the clrscr() statements).
You can then increase MAXNODE to 5000 so that it will be less
likely to run out of memory.  It may take a long time to solve
very complicated configurations, though.



