E - Knight Moves
来源:互联网 发布:seo的营销方法 编辑:程序博客网 时间:2024/05/29 06:30
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.
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.
e2 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 f6
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 <queue>#include<algorithm>using namespace std;int step;int to[8][2] = {-2,1,-1,2,1,2,2,1,2,-1,1,-2,-1,-2,-2,-1};//骑士移动的8个方位int map[10][10],ex,ey;char s1[5],s2[5];struct node{ int x,y,step;};int check(int x,int y){ if(x<0 || y<0 || x>=8 || y>=8 || map[x][y]) return 1; return 0;}int bfs(){ queue<node>Q; node p,q,next; p.x=s1[0]-'a'; p.y=s1[1]-'1'; p.step=0; ex=s2[0]-'a'; ey=s2[1]-'1'; memset(map,0,sizeof(map)); map[p.x][p.y]=1; Q.push(p); while(!Q.empty()) { q=Q.front(); Q.pop(); if(q.x==ex&&q.y==ey) return q.step; for(int i=0; i<8; i++) { next.x=q.x+to[i][0]; next.y=q.y+to[i][1]; if(check(next.x,next.y)) continue; next.step=q.step+1; map[next.x][next.y]=1; Q.push(next); } } return 0;}int main(){ while(~scanf("%s%s",s1,s2)) { printf("To get from %s to %s takes %d knight moves.\n",s1,s2,bfs()); } return 0;}
0 0
- E - 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
- java学习笔记——毕向东视频day05
- 工厂三姐妹
- task_struck结构体成员注释
- 图——AOV拓扑排序
- 某高人的学习笔记--鄙人也是从这些资料学习的!!!
- E - Knight Moves
- aix rac ssh建立对等关系,故障一则
- MongoDB中的数据查询
- Spark1.6源码编译
- Spring(九)CGLIB字节码增强
- android——串口通信
- mybatis中orderBy排序
- ISE调用ue
- slab分配器