#include<stdio.h>
#include<string.h>
#include<stdlib.h>
const int maxn=70;
int dir[8][2]={{-1,-2},{-1,2},{-2,-1},{-2,1},
{1,-2},{1,2},{2,-1},{2,1}};
struct Point
{
int x,y,n;//n steps
};
Point q[maxn];
bool vis[9][9];
int main()
{
#ifndef ONLINE_JUDGE
freopen("439.txt","r",stdin);
#endif
char s1[3],s2[3];
while(scanf("%s%s",s1,s2)==2)
{
int i,j,m,n;
i=s1[1]-'0';j=s1[0]-'a'+1;
m=s2[1]-'0';n=s2[0]-'a'+1;
//printf("%d %d %d %d\n",i,j,m,n);
memset(vis,0,sizeof(vis));
int front=0,rear=0;
Point A,B;
A.x=i;
A.y=j;
A.n=0;
q[rear++]=A;
vis[A.x][A.y]=true;
for(;;)
{
A=q[front++];
if(A.x==m && A.y==n) break;
for(int k=0;k<8;k++)
{
B.x=A.x+dir[k][0];
B.y=A.y+dir[k][1];
if(!vis[B.x][B.y] && B.x>=1 && B.x<=8 && B.y>=1 && B.y<=8)
{
vis[B.x][B.y]=true;
B.n=A.n+1;
q[rear++]=B;
}
}
}
printf("To get from %s to %s takes %d knight moves.\n",s1,s2,A.n);
}
return 0;
}
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
const int maxn=70,maxm=64;
int dir[8][2]={{-1,-2},{-1,2},{-2,-1},{-2,1},
{1,-2},{1,2},{2,-1},{2,1}};
int q[maxn];
bool vis[8][8];
int dist[maxm][maxm];
void bfs(int x,int y)
{
memset(vis,0,sizeof(vis));
int front=0,rear=0,d,u;
u=x*8+y;
dist[u][u]=0;
vis[x][y]=true;
q[rear++]=u;
while(front<rear)
{
int p=q[front++];
x=p/8;y=p%8;
//vis[x][y]=true; 如果在这里标记,那会重算很多次。
for(d=0;d<8;d++)
{
int nx=x+dir[d][0];
int ny=y+dir[d][1];
int v=nx*8+ny;
if(nx>=0 && nx<8 && ny>=0 && ny<8 && !vis[nx][ny])
{
vis[nx][ny]=true;
q[rear++]=v;
if(dist[u][v]<0)
{
dist[v][u]=dist[u][v]=dist[u][p]+1;
}
}
}
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("439.txt","r",stdin);
#endif
int i,j;
memset(dist,-1,sizeof(dist));
for(i=0;i<8;i++)
for(j=0;j<8;j++)
bfs(i,j);
/*int max=0;
for(i=0;i<maxm;i++)
for(j=0;j<maxm;j++)
if(max<dist[i][j]) max=dist[i][j];
printf("max=%d\n",max);*/
//printf("ok\n");
char s1[3],s2[3];
while(scanf("%s%s",s1,s2)==2)
{
int m,n;
i=s1[1]-'1';j=s1[0]-'a';
m=s2[1]-'1';n=s2[0]-'a';
int u=i*8+j;
int v=m*8+n;
printf("To get from %s to %s takes %d knight moves.\n",s1,s2,dist[u][v]);
}
return 0;
}