POJ1077 Eight —— 经典的搜索问题
来源:互联网 发布:锦瑟 priest 知乎 编辑:程序博客网 时间:2024/06/10 07:45
题目链接:http://poj.org/problem?id=1077
Eight
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33267 Accepted: 14404 Special Judge
Description
The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one tile missing. Let's call the missing tile 'x'; the object of the puzzle is to arrange the tiles so that they are ordered as:
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:
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 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.
Input
You will receive a description of a configuration of the 8 puzzle. The description is just a list of the tiles in their initial positions, with the rows listed from top to bottom, and the tiles listed from left to right within a row, where the tiles are represented by numbers 1 to 8, plus 'x'. For example, this puzzle
is described by this list:
1 2 3 x 4 6 7 5 8
is described by this list:
1 2 3 x 4 6 7 5 8
Output
You will print to standard output either the word ``unsolvable'', if the puzzle has no solution, or a string consisting entirely of the letters 'r', 'l', 'u' and 'd' that describes a series of moves that produce a solution. The string should include no spaces and start at the beginning of the line.
Sample Input
2 3 4 1 5 x 7 6 8
Sample Output
ullddrurdllurdruldr
Source
South Central USA 1998
题解:
1.对于棋盘,所有的情况为:9! <4e5<1e6,所以使用枚举的方法是不会超时的,前提是数据较弱(如POJ1077),或者一次性枚举预处理掉所有情况(HDU1043)。
2.对于判重:使用STL的set肯定会超时的。一开始想利用十进制数,每一位保存一个格子,结果9个格子就是9位数,数组根本开不了那么大,所以此种尝试失败。后来看到康拓,不太理解为什么能用(不会用冲突吗?),但还是先用着,有时间再研究一下。如果下次遇到类似123456789这九个数需要进行哈希的,就使用康拓试试。
3.推荐阅读:八数码的八境界 —— 来自liugoodness,特此鸣谢。
写法:
1.正向BFS:http://blog.csdn.net/dolfamingo/article/details/77855338
2.反向BFS:http://blog.csdn.net/dolfamingo/article/details/77855373
3.双向BFS:http://blog.csdn.net/dolfamingo/article/details/778554914. A*算法 :http://blog.csdn.net/dolfamingo/article/details/77855498
5.IDA*算法:http://blog.csdn.net/dolfamingo/article/details/77855518
阅读全文
0 0
- POJ1077 Eight —— 经典的搜索问题
- POJ1077——Eight
- Eight poj1077 广度优先搜索
- poj1077 Eight —— 正向bfs+康拓
- POJ1077 Eight —— 正向BFS
- POJ1077 Eight —— 反向BFS
- POJ1077 Eight —— 双向BFS
- POJ1077 Eight —— A*算法
- POJ1077 Eight —— IDA*算法
- poj1077 Eight
- POJ1077(经典的八数码问题)
- poj1077 hdu1043 Eight 八数码问题
- poj1077 /hdoj 1043 Eight
- 【POJ1077】Eight【IDA*】
- POJ1077、HDU1043 Eight 八数码问题:双向BFS、A*
- 【POJ1077】Eight 八数码问题,解题报告+思路+代码
- 【康托展开+状压BFS】poj1077 Eight(八数码问题)
- Poj1077/HDU1043(A*搜索)八数码问题
- linux常用bash命令介绍
- jdk下载与安装
- 网络文明从我做起
- 解救小哈 2
- 使用RedisTemplate进行Redis存取的工具类设计
- POJ1077 Eight —— 经典的搜索问题
- HDU
- H5 app android版本更新
- java AWT事件 以及 常见的语义事件,底层事件和相应监听器类以及适配器类
- JDBC批量插入数据效率分析
- 左偏树(可并堆)详解及有关模板
- HashMap的使用
- maven 聚合和继承
- Error Code: 1093. You can't specify target table,delete或者update的where条件中有子查询解决办法