#include <iostream>
#include <queue>
using namespace std;
int sx,sy,ex,ey;
int dist[8][8]; //dis[i][j] 到当前点(i,j)所花的最少步数
int step[8][2]={{-1,2},{-1,-2},{1,2},{1,-2},
{2,1},{2,-1},{-2,1},{-2,-1}};
int BFS()
{
memset(dist,-1,sizeof(dist));
queue<int> q;
int x1,y1,x2,y2;
dist[sx][sy]=0;
q.push(sx);
q.push(sy);
while(!q.empty())
{
x1=q.front();q.pop();
y1=q.front();q.pop();
if(x1==ex&&y1==ey) //找到要找的点
return dist[x1][y1];
for(int i=0;i<8;i++)
{
x2=x1+step[i][0];
y2=y1+step[i][1];
if(x2<0||x2>7||y2<0||y2>7||dist[x2][y2]>0)
continue;
dist[x2][y2]=dist[x1][y1]+1;
q.push(x2);
q.push(y2);
}
}
return -1;
}
int main()
{
char a[3],b[3];
int ans;
while(scanf("%2s %2s",a,b)!=EOF)
{
sx=a[0]-'a';
sy=a[1]-'1';
ex=b[0]-'a';
ey=b[1]-'1';
ans=BFS();
printf("To get from %s to %s takes %d knight moves.\n",a,b,ans);
}
}
HDU 1372 棋盘广搜
最新推荐文章于 2021-11-05 10:58:57 发布