Introduction - If you have any usage issues, please Google them yourself
a source code that solves the 8 puzzle problem. it uses A-star algorithm, and a major data structure of Vector<int[]>. The output of the program would be "no solution" or a series of strings representing the moves during the solution.
Well, some samples need to be proceeded for around 30 seconds, but the program per se is indeed correct and will ultimately generate the shortest solution. so if u encounter such occasion plz jst wait for a while tho~~~ thnx~!!
the heuristic function, say h(x), in this source code is the sum of the Mahattan Distance of each block from its destination block.
How to use: build a Java Project, and create three .java files with the same names in the .zip file accordingly, and copy the source from the .zip file and just compile and run~~!
have fun thnx~!