POJ2286 The Rotation Game(IDA*)
The Rotation Game
Time Limit: 15000MS |
Memory Limit: 150000K |
|
Total Submissions: 5691 |
Accepted: 1918 |
Description
The rotation game uses a # shaped board, which can hold 24 pieces of square blocks (see Fig.1). The blocks are marked with symbols 1, 2 and 3, with exactly 8 pieces of each kind.
Initially, the blocks are placed on the board randomly. Your task is to move
the blocks so that the eight blocks placed in the center square have the same
symbol marked. There is only one type of valid move, which is to rotate one of
the four lines, each consisting of seven blocks. That is, six blocks in the
line are moved towards the head by one block and the head block is moved to the
end of the line. The eight possible moves are marked with capital letters A to
H. Figure 1 illustrates two consecutive moves, move A and move C from some
initial configuration.
Input
The input consists of no more than 30 test cases. Each
test case has only one line that contains 24 numbers, which are the symbols of
the blocks in the initial configuration. The rows of blocks are listed from top
to bottom. For each row the blocks are listed from left to right. The numbers
are separated by spaces. For example, the first test case in the sample input
corresponds to the initial configuration in Fig.1. There are no blank lines
between cases. There is a line containing a single `0' after the last test case
that ends the input.
Output
For each test case, you must output two lines. The first
line contains all the moves needed to reach the final configuration. Each move
is a letter, ranging from `A' to `H', and there should not be any spaces
between the letters in the line. If no moves are needed, output `No moves
needed' instead. In the second line, you must output the symbol of the blocks
in the center square after these moves. If there are several possible
solutions, you must output the one that uses the least number of moves. If
there is still more than one possible solution, you must output the solution
that is smallest in dictionary order for the letters of the moves. There is no
need to output blank lines between cases.
Sample Input
1 1 1 1 3 2 3 2 3 1 3 2 2 3 1 2 2 2 3 1 2 1 3 3
1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3
0
Sample Output
AC
2
DDHH
2
Source
【思路】
IDA*算法。
IDA*=ID-DFS+A*,即不断加深搜索的深度并设计一个乐观估计函数进行剪枝。
应用与本题中;
乐观估计:设中心8个数字最小不相同的数目为h,则至少需要dep+h个操作才能使得满足条件(dep为当前深度)。
迭代加深:不断增加操作数的数目,只要有符合的则中断迭代。
参考了紫书的附加代码,其中的hash有效简化了程序。
【代码】
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<iostream>
#define FOR(a,b,c) for(int a=(b);a<(c);a++)
using namespace std; int hash[][]={
{,,,,,,},
{,,,,,,},
{,,,,,,},
{,,,,,,} };
const int rev[]={,,,,,,,};
const int certain[]={,,,,,,,}; int a[];
char ans[]; int diff(int c) {
int cnt=;
FOR(i,,) if(c!=a[certain[i]]) cnt++;
return cnt;
} int h() {
return min(min(diff(),diff()),diff());
} bool is_final() {
FOR(i,,) if(a[certain[]]!=a[certain[i]]) return false;
return true;
} void move(int i) {
int tmp=a[hash[i][]];
FOR(j,,) a[hash[i][j]]=a[hash[i][j+]];
a[hash[i][]]=tmp;
} bool IDDFS(int dep,int max_d) {
if(is_final()) {
ans[dep] = '\0';
cout<<ans<<"\n";
return true;
}
if(dep+h()>max_d) return false;
FOR(i,,) {
ans[dep] = 'A'+i;
move(i);
if(IDDFS(dep+,max_d)) return true;
move(rev[i]);
}
return false;
} int main()
{
FOR(i,,) {
FOR(j,,) hash[i][j]=hash[rev[i]][-j];
}
while(scanf("%d",&a[]) && a[])
{
FOR(i,,) scanf("%d",&a[i]);
FOR(i,,) if(!a[i]) return ;
if(is_final())
printf("No moves needed\n");
else {
for(int max_d=; ;max_d++)
if(IDDFS(,max_d)) break;
}
printf("%d\n",a[]);
}
return ;
}
POJ2286 The Rotation Game(IDA*)的更多相关文章
- POJ - 2286 - The Rotation Game (IDA*)
IDA*算法,即迭代加深的A*算法.实际上就是迭代加深+DFS+估价函数 题目传送:The Rotation Game AC代码: #include <map> #include < ...
- POJ 2286 The Rotation Game(IDA*)
The Rotation Game Time Limit: 15000MS Memory Limit: 150000K Total Submissions: 6396 Accepted: 21 ...
- UVA-1343 The Rotation Game (IDA*)
题目大意:数字1,2,3都有八个,求出最少的旋转次数使得图形中间八个数相同.旋转规则:对于每一长行或每一长列,每次旋转就是将数据向头的位置移动一位,头上的数放置到尾部.若次数相同,则找出字典序最小旋转 ...
- 【UVa】1343 The Rotation Game(IDA*)
题目 题目 分析 lrj代码.... 还有is_final是保留字,害的我CE了好几发. 代码 #include <cstdio> #include <algorit ...
- Booksort POJ - 3460 (IDA*)
Description The Leiden University Library has millions of books. When a student wants to borrow a ce ...
- ArcGIS Desktop和Engine中对点要素图层Graduated Symbols渲染的实现 Rotation Symbol (转)
摘要 ArcGIS中,对于要素图层的渲染,支持按照要素字段的值渲染要素的大小,其中Graduated Symbols可以对大小进行分级渲染.在个人开发系统的过程中,也可以用来美化数据显 ...
- UVA - 10384 The Wall Pusher(推门游戏)(IDA*)
题意:从起点出发,可向东南西北4个方向走,如果前面没有墙则可走:如果前面只有一堵墙,则可将墙向前推一格,其余情况不可推动,且不能推动游戏区域边界上的墙.问走出迷宫的最少步数,输出任意一个移动序列. 分 ...
- 人类即将进入互联网梦境时代(IDA)
在电影<盗梦空间>中,男主角科布和妻子在梦境中生活了50年,从楼宇.商铺.到河流浅滩.一草一木.这两位造梦师用意念建造了属于自己的梦境空间.你或许并不会想到,在不久未来,这看似科幻的情节将 ...
- The Rotation Game(IDA*算法)
The Rotation Game Time Limit : 30000/15000ms (Java/Other) Memory Limit : 300000/150000K (Java/Othe ...
随机推荐
- Asp.net MVC利用Ajax.BeginForm实现bootstrap模态框弹出,并进行前段验证
1.新建Controller public ActionResult Index() { return View(); } public ActionResult Person(int? id) { ...
- Objective-C 实例方法可见度,方法
一 实例方法可见度,方法 1.实例变量的可见度 可见度 特点 ...
- 2016.7.13final 修饰符使用
final修饰符可以修饰类.变量.函数: 1.被final所修饰的类不能被继承,函数不能被继承,成员变量不能再次被赋值并且被称为常量: 2.被final 修饰的成员变量 .它通常被static所修饰, ...
- 谢尔排序/缩减增量排序(C++)
谢尔排序/缩减增量排序(C++) 谢尔排序/缩减增量排序: 他通过比较相距一定间隔的元素来工作,各趟比较所用的距离随着算法的进行而减小,直到只比较相邻元素的最后一趟排序为止.(好复杂) 看了一下实现代 ...
- Servlet监听器类型
------------------------serlvet对象监听器------------------------------------------- request监听器(ServletRe ...
- CSS负边距自适应布局三例
单列定宽单列自适应布局: <!DOCTYPE HTML> <html> <head> <meta charset=”UTF-8″> <title& ...
- C#遍历所有的Textbox控件并赋值为String.Empty
foreach (Control control in this.Controls) { if (control.GetType().Name.Equals("TextBox")) ...
- 用jQuery实现瀑布流效果学习笔记
jQuery一直没系统的学,只知道是js库,封装了好多js函数,方便了开发.以前做过一个原生的图片网站瀑布流效果,超级麻烦,这次用了jQuery方法,瞬间代码浓缩了,只有56行js代码.神奇的让我来把 ...
- you need to be root to perform this command linux
获得root权限如何获得:打开终端,输入su回车 然后输入密码回车就行了
- C# ERP开发框架
C/S系统开发框架-企业版 V4.0 (Enterprise Edition) 简介: http://www.csframework.com/cs-framework-4.0.htm 视频下载: 百度 ...