Eight
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27216 Accepted Submission(s): 7257
Special Judge
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 x
where the only legal operation is to exchange 'x' with one of the tiles with which it shares an edge. As an example, the following sequence of moves solves a slightly scrambled puzzle:
1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8 9 x 10 12 9 10 x 12 9 10 11 12 9 10 11 12 13 14 11 15 13 14 11 15 13 14 x 15 13 14 15 x r-> d-> r->
The letters in the previous row indicate which neighbor of the 'x' tile is swapped with the 'x' tile at each step; legal values are 'r','l','u' and 'd', for right, left, up, and down, respectively.
Not all puzzles can be solved; in 1870, a man named Sam Loyd was famous for distributing an unsolvable version of the puzzle, and
frustrating many people. In fact, all you have to do to make a regular puzzle into an unsolvable one is to swap two tiles (not counting the missing 'x' tile, of course).
In this problem, you will write a program for solving the less well-known 8-puzzle, composed of tiles on a three by three
arrangement.
1 2 3
x 4 6
7 5 8
is described by this list:
1 2 3 x 4 6 7 5 8
2 3 4 1 5 x 7 6 8
ullddrurdllurdruldr
翻译:
2 3 4
1 5 x
7 6 8
是我们的目标状态
1 2 3
4 5 6
7 8 9
是我们的起始状态
u=up
l=left
d=down
r=right
输出就是输出找到后的方向,否则就是没找到,输出unsolved
思路:
可以用反向bfs,从结果出发,找到这个状态。也可以双向bfs。也可以A*,也可以IDA*。
1.暴力反向BFS+存状态http://blog.csdn.net/qq_36523667/article/details/78787668
2.暴力反向BFS+康托展开判重http://blog.csdn.net/qq_36523667/article/details/78790957
3.暴力反向BFS+康托展开判重+打表http://blog.csdn.net/qq_36523667/article/details/78793695
4.暴力反向BFS+康托展开判重+打表+回溯记录路径http://blog.csdn.net/qq_36523667/article/details/78797657
5.双向BFS+康托展开判重+回溯记录路径http://blog.csdn.net/qq_36523667/article/details/78797920
6.双向BFS+康托展开判重+回溯记录路径+逆序数判无解http://blog.csdn.net/qq_36523667/article/details/78798188
7.A*之曼哈顿+康托展开判重+回溯记录路径+逆序数判无解http://blog.csdn.net/qq_36523667/article/details/78805842
8.IDA*+逆序数判无解http://blog.csdn.net/qq_36523667/article/details/78805994
(请按顺序看哦,这是逐步深入的8中方法,每种都对各种知识有很详细的介绍和很严格的证明)