UVA 439 Knight Moves
移动骑士,求最小步数,简单的广搜。。。水过
#include <stdio.h>
#include <string.h>
int d[8][2] = {{1,2},{1,-2},{-1,2},{-1,-2},{2,1},{2,-1},{-2,1},{-2,-1}};
char a[3],b[3];
int num;
int x, y ,xx ,yy;
struct Q
{
int x;
int y;
int bu;
} q[10005];
int vis[15][15];
void bfs(int x, int y)
{
int head = 0;
int rear = 1;
q[head].x = x;
q[head].y = y;
for (int i = 0; i < 10005; i ++)
{
q[i].bu = 99999;
}
q[head].bu = 0;
while (head < rear)
{
for (int i = 0; i < 8; i ++)
{
if (q[head].x + d[i][0] == xx && q[head].y + d[i][1] == yy)
{
num = q[head].bu + 1;
return;
}
if (q[head].x + d[i][0] >= 1 && q[head].x + d[i][0] <= 8 && q[head].y + d[i][1] >= 1 && q[head].y + d[i][1] <= 8)
{
q[rear].x = q[head].x + d[i][0];
q[rear].y = q[head].y + d[i][1];
q[rear].bu = q[head].bu + 1;
rear ++;
}
}
head ++;
}
}
int main()
{
while(scanf("%s%s", a, b) != EOF)
{
num = 0;
memset(vis, 0, sizeof(vis));
memset(q, 0, sizeof(q));
x = a[0] - 'a' + 1;
y = a[1] - '0';
xx = b[0] - 'a' + 1;
yy = b[1] - '0';
bfs(x, y);
if (x == xx && y == yy)
num = 0;
printf("To get from %s to %s takes %d knight moves.\n",a,b, num);
}
return 0;
}