Knight Moves
来源:互联网 发布:3年java工资待遇杭州 编辑:程序博客网 时间:2024/05/01 19:09
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 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 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<stdio.h>#include<string.h>#include<iostream>#include<queue>using namespace std;struct node{ int x; int y; int f;};char bx,ex;int by,ey;int MAP[10][10];int dir[8][2]= {{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2}};node bfs(node p){ int fx,fy; memset(MAP,0,sizeof(MAP)); fx=ex-'a'+1; fy=ey; node m; queue<node>q; q.push(p); while(!q.empty()) { m=q.front(); q.pop(); // cout<<m.x<<m.y<<m.f<<endl; MAP[m.x][m.y]=1; if(m.x==fx&&m.y==fy) return m; for(int i=0; i<8; i++) { if((m.x+dir[i][0]>=1)&&(m.x+dir[i][0]<=8)&&(m.y+dir[i][1]>=1)&&(m.y+dir[i][1]<=8)&&(MAP[m.x+dir[i][0]][m.y+dir[i][1]]==0))//判断是否超界,是否访问过 { p.x=m.x+dir[i][0]; p.y=m.y+dir[i][1]; p.f=m.f+1; MAP[p.x][p.y]=1;//标记已访问 q.push(p);//入队列 } } }}int main(){ node ans; while(cin>>bx) { cin>>by; cin>>ex; cin>>ey; node p; p.x=bx-'a'+1; p.y=by; p.f=0; ans=bfs(p); printf("To get from %c%d to %c%d takes %d knight moves.\n",bx,by,ex,ey,ans.f); } return 0;}
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- FPGA 设计如何进行面积优化(逻辑资源占用量优化)
- 关于Android连接远程数据库(mysql、oracle)
- [leetcode]Anagrams
- rpm
- Jquery:为标签添加data存放额外数据
- Knight Moves
- HashSet源码分析
- 编程算法 - 硬币问题 代码(C)
- Map集合的遍历
- 呵呵
- Git 常用命令详解<转>
- 不用递归获取树节点的所有层级子节点
- WIN7 JDK1.6 环境变量设置
- win7系统,QTP11录制脚本空,BHOManager Class已经启用