题目;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.<br>Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part. <br><br>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. <br>
思路:广的用法搜 !
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int map[10][10];
int fx,fy,lx,ly;
char a[3],b[3];
struct node
{
int x,y,num;
};
int d[8][2]={-2,1, -1,2, 1,2, 2,1, 2,-1, 1,-2, -1,-2, -2,-1};//Knight的八个移动方位
void bfs(int x,int y)
{
int i;
node t,p;
queue<node> q;
t.x=x;t.y=y;t.num=0;
memset(map,0,sizeof(map));//每一回合棋盘初始为未被访问状态
map[t.x][t.y]=1;
q.push(t);
while(!q.empty())
{
t=q.front();q.pop();
if(t.x==lx&&t.y==ly)
{
printf("To get from %s to %s takes %d knight moves.\n",a,b,t.num);
return;
}
for(i=0;i<8;i++)
{
if((t.x+d[i][0]>0)&&(t.x+d[i][0]<9)&&(t.y+d[i][1]>0) //判断移动是否越界
&&(t.y+d[i][1]<9)&&!map[t.x+d[i][0]][t.y+d[i][1]])//和移动的格子是否已被访问
{
p.x=t.x+d[i][0];
p.y=t.y+d[i][1];
p.num=t.num+1;
q.push(p);
}
}
}
}
int main()
{
while(scanf("%s%s",a,b)!=EOF)
{
fx=a[0]-'a'+1;fy=a[1]-'0';
lx=b[0]-'a'+1;ly=b[1]-'0';
bfs(fx,fy);
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int map[10][10];
int fx,fy,lx,ly;
char a[3],b[3];
struct node
{
int x,y,num;
};
int d[8][2]={-2,1, -1,2, 1,2, 2,1, 2,-1, 1,-2, -1,-2, -2,-1};//Knight的八个移动方位
void bfs(int x,int y)
{
int i;
node t,p;
queue<node> q;
t.x=x;t.y=y;t.num=0;
memset(map,0,sizeof(map));//每一回合棋盘初始为未被访问状态
map[t.x][t.y]=1;
q.push(t);
while(!q.empty())
{
t=q.front();q.pop();
if(t.x==lx&&t.y==ly)
{
printf("To get from %s to %s takes %d knight moves.\n",a,b,t.num);
return;
}
for(i=0;i<8;i++)
{
if((t.x+d[i][0]>0)&&(t.x+d[i][0]<9)&&(t.y+d[i][1]>0) //判断移动是否越界
&&(t.y+d[i][1]<9)&&!map[t.x+d[i][0]][t.y+d[i][1]])//和移动的格子是否已被访问
{
p.x=t.x+d[i][0];
p.y=t.y+d[i][1];
p.num=t.num+1;
q.push(p);
}
}
}
}
int main()
{
while(scanf("%s%s",a,b)!=EOF)
{
fx=a[0]-'a'+1;fy=a[1]-'0';
lx=b[0]-'a'+1;ly=b[1]-'0';
bfs(fx,fy);
}
return 0;
}
感悟; 英语 题意难懂啊 看了很长时间 明白这是 马走日 的问题 !很好熟悉了深搜 和队列的用法