启发式搜索及应用、POJ1077
来源:互联网 发布:linux延时函数 编辑:程序博客网 时间:2024/06/11 07:30
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
未完,下次再续。。。。。。。。
- 启发式搜索及应用、POJ1077
- 启发式搜索
- 启发式搜索
- 启发式搜索
- 启发式搜索
- 启发式搜索
- 启发式搜索
- Eight poj1077 广度优先搜索
- poj1077
- poj1077
- POJ1077
- poj1077
- Poj1077/HDU1043(A*搜索)八数码问题
- 启发式搜索算法
- 【启发式搜索】Remmarguts' Date
- 启发式搜索算法
- 贪心算法::启发式搜索
- 启发式搜索技术 A*
- c# 中的file和fileinfo,directory和directoryinfo以及filesysteminfo
- #define用法
- stdafx.h作用及原理
- 文件上传
- Java二叉树排序及任意两点个节点间的最大距离
- 启发式搜索及应用、POJ1077
- 【语言】C++野指针分析
- U-mail邮件群发:采集有效邮箱地址的八种方法
- li列表中显示文字强制不换行,大于li宽度自动隐藏文字
- json jsonp分析
- css 背景透明,文字不透明,alpha滤镜,opacity,position:relative;
- CSS实现半透明效果实现及兼容性
- js简单实现div遮罩层
- div css背景颜色半透明 文字不透明兼容ie、火狐等浏览器