国际象棋

#include <bits/stdc++.h>
using namespace std;
int tx,ty;
int visited[10][10];
struct node
{int x,y,s;
};
int dx[8]={-1,-2,1,2,1,2,-1,-2};//
int dy[8]={2,1,2,1,-2,-1,-2,-1};//
int bfs(int sx,int sy,int ss)
{if(sx==tx&&sy==ty) return 0;queue<node>p;p.push({sx,sy,ss});while(!p.empty()){auto it=p.front();p.pop();int x=it.x;int y=it.y;int s=it.s;if(x==tx&&y==ty) return s;for(int i=0;i<8;i++){int nx=x+dx[i];int ny=y+dy[i];int ns=s+1;if(nx<0||nx>=8||ny<0||ny>=8) continue;if(visited[nx][ny]) continue;visited[nx][ny]=1;p.push({nx,ny,ns});}}
}
int main()
{char s1[3];char s2[3];//while(scanf("%s %s",s1,s2)==2)//{memset(visited,0,sizeof(visited));int sx=s1[1]-'1';//int sy=s1[0]-'a';//tx=s2[1]-'1';ty=s2[0]-'a';visited[sx][sy]=1;int ans=bfs(sx,sy,0);printf("To get from %s to %s takes %d knight moves.\n",s1,s2,ans);}
}