Knight Moves

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 56 Accepted Submission(s) : 41

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy.
Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.

Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b.

Input

The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard.

Output

For each test case, print one line saying "To get from xx to yy takes n knight moves.".

Sample Input

e2 e4
a1 b2
b2 c3
a1 h8
a1 h7
h8 a1
b1 c3
f6 f6

Sample Output

To get from e2 to e4 takes 2 knight moves.
To get from a1 to b2 takes 4 knight moves.
To get from b2 to c3 takes 2 knight moves.
To get from a1 to h8 takes 6 knight moves.
To get from a1 to h7 takes 5 knight moves.
To get from h8 to a1 takes 6 knight moves.
To get from b1 to c3 takes 1 knight moves.
To get from f6 to f6 takes 0 knight moves.#include<iostream>
#include<algorithm>
#include<string.h>
#include<cstdio>
#include<queue>
int d[8][2] = { {2,1},{2,-1},{-2,1},{-2,-1},{1,2},{1,-2},{-1,2},{-1,-2} };
bool b[9][9];
using namespace std;
struct node
{
int x, y,step;
};
int main()
{
char a1[2], a2[2];
while (cin>>a1>>a2)
{
memset(b, 0, sizeof(b));
int x1, y1, x2, y2;
x1 = a1[0] - 'a' + 1; y1 = a1[1] - '0';
x2 = a2[0] - 'a' + 1; y2 = a2[1] -'0';
queue<node> P;
node dc; dc.x = x1, dc.y = y1,dc.step=0;
P.push(dc); b[x1][y1] = 1;
while (!P.empty())
{
node de = P.front(); P.pop();
if (de.x == x2&&de.y == y2)
{
printf("To get from %s to %s takes %d knight moves.\n", a1, a2, de.step);
break;
}
for (int i = 0; i < 8; i++)
{
int xx = de.x + d[i][0], yy = de.y + d[i][1], step2 = de.step + 1;
if (xx >= 1 && xx <= 8 && yy >= 1 && yy <= 8&&b[xx][yy]==0)
{
b[xx][yy] = 1;
dc.x = xx, dc.y = yy, dc.step = step2;
P.push(dc);
}
}
}
while (!P.empty()) P.pop();
}
return 0;
}

HDU Knight Moves相关推荐

HDU 1372 Knight Moves
最近在学习广搜这道题同样是一道简单广搜题=0= 题意:(百度复制粘贴0.0) 题意:给出骑士的骑士位置和目标位置,计算骑士要走多少步思路:首先要做这道题必须要理解国际象棋中骑士的走法,国际象棋中 ...
poj - 2243 Knight Moves
这题和poj 1915一样,用bfs做走马步.现在再看当时的代码,真是好幼稚啊. 1 #include <stdio.h> 2 #include <string.h> 3 in ...
1 Knight Moves
Problem F- Knight Moves 题目来源:https://vjudge.net/contest/207868#problem/F Problem description: 题意概括:中 ...
OpenJudge/Poj 1915 Knight Moves
1.链接地址: http://bailian.openjudge.cn/practice/1915 http://poj.org/problem?id=1915 2.题目: 总Time Limit: ...
hdu1372 Knight Moves BFS 搜索
简单BFS题目主要是读懂题意和中国的象棋中马的走法一样,走日字型,共八个方向我最初wa在初始化上了....以后多注意... 代码: 1 #include <iostream> 2 # ...
Knight Moves
Knight Moves poj-1915 题目大意:在国际象棋中有一个骑士,想从一个点到达另一个点.骑士可以从2*3的矩阵的一角跳到对角线的另一角.问:骑士最少需要跳多少次才能从一个点跳到另一个点. ...
POJ2243 Knight Moves —— A*算法
题目链接:http://poj.org/problem?id=2243 Knight Moves Time Limit: 1000MS Memory Limit: 65536K Total Sub ...
zoj 1091 Knight Moves
题目见zoj 1091 使用宽度搜索优先来求解,这个算法已经忘记的差不多了,所以写出来的代码很罗嗦,看起来很不清晰. 好像还可以直接用公式或者神经网络算法求解,详见Knight's Tour /* z ...
（BFS）Knight Moves（hdu1372）
题目: 在象棋王国,尼古拉斯.火山是一匹英俊的马,他非常幸运迎娶了白马王国的公主,他们将度蜜月,你现在是他们的女仆,火山会问你去一些地方最少需要多少步,这么简单的事当然难不倒你.由于火山是一匹马,他的 ...

HDU Knight Moves