Knight Moves--广度优先搜索
2014-07-17 11:37
344 查看
Knight Moves
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 Specification
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 Specification
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.
如图所示,举个例子在d4这个位子,有8个方向
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 Specification
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 Specification
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.
如图所示,举个例子在d4这个位子,有8个方向
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
a | ||||||||
b | * | * | ||||||
c | * | * | ||||||
d | # | |||||||
e | * | * | ||||||
f | * | * | ||||||
g | ||||||||
h |
#include<stdio.h> #include<iostream> #include<queue> using namespace std; int dir[8][2]={{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2}}; struct node { char c; int a,sum; }F,L; int main() { int i; node temp; queue<node>Q; while(cin>>F.c>>F.a>>L.c>>L.a!=NULL) { cout<<"To get from "<<F.c<<F.a<<" to "<<L.c<<L.a<<" takes "; while(!Q.empty())Q.pop(); F.sum=0; Q.push(F); while(1) { F=Q.front(); Q.pop(); if(F.c==L.c&&F.a==L.a) break; for(i=0; i<8; i++) { temp.c=F.c+dir[i][0]; temp.a=F.a+dir[i][1]; temp.sum=F.sum+1; if(temp.c<'a'||temp.c>'h'||temp.a<1||temp.a>8) continue; Q.push(temp); } } cout<<F.sum<<" knight moves.\n"; } return 0; }
相关文章推荐
- POJ1915 - Knight Moves - 广度优先搜索
- C++广度优先搜索之Knight Moves
- POJ 1915 Knight Moves (广度搜索)
- zoj - 1091 - Knight Moves(广度优先地图记数法)
- zoj - 1091 - Knight Moves(广度优先地图记数法)
- 数据结构实验之图论一:基于邻接矩阵的广度优先搜索遍历1
- 数据结构实验之图论一:基于邻接矩阵的广度优先搜索遍历
- 【算法入门】广度/宽度优先搜索(BFS)
- 深度优先搜索和广度优先搜索的深入讨论
- zoj - 1091 - Knight Moves(广度优先法)
- 图的深度优先搜索DFS和广度优先搜索BFS
- 关于广度优先搜索的理解
- 写给妹妹的编程札记 5 - 搜索: 迷宫问题 - 广度优先搜索
- 基于图的深度优先搜索和广度优先搜索java实现
- 算法竞赛入门经典:第七章 暴力求解法 7.18 广度优先搜索之八数码问题
- 广度优先搜索
- 小游戏系列算法之五广度优先搜索,双向广搜,八数码,华容道
- 广度优先搜索解决迷宫问题
- File&&文件搜索深度优先和广度优先
- 广度优先搜索练习之神奇的电梯