ACM 搜索 hdu 1372 Knight Moves

1. Problem Description
   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.
   Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.
   
   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.
   
    
   
   
   Input
   The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard.
   
    
   
   
   Output
   For each test case, print one line saying "To get from xx to yy takes n knight moves.".
   
    
   
   
   Sample Input

       
       
   
        
        e2 e4
   a1 b2
   b2 c3
   a1 h8
   a1 h7
   h8 a1
   b1 c3
   f6 f6
       
       

    
   
   
   Sample Output

       
       
   
        
        To get from e2 to e4 takes 2 knight moves.
   To get from a1 to b2 takes 4 knight moves.
   To get from b2 to c3 takes 2 knight moves.
   To get from a1 to h8 takes 6 knight moves.
   To get from a1 to h7 takes 5 knight moves.
   To get from h8 to a1 takes 6 knight moves.
   To get from b1 to c3 takes 1 knight moves.
   To get from f6 to f6 takes 0 knight moves.
       
       

    
   
   
   Source
   
   

         经典的bsd：但注意不是走上下左右，而是走“日”，不存在绊马脚。一共8个方向

1. 
   
2. #include<iostream>  
3. #include<cstdio>  
4. #include<cstring>  
5. #include<queue>  
6. using namespace std;  
7. int map[10][10];  
8. int fx,fy,lx,ly;  
9. char a[3],b[3];  
10. struct node  
11. {  
12.     int x,y,num;  
13. };  
14. int d[8][2]={-2,1, -1,2, 1,2, 2,1, 2,-1, 1,-2, -1,-2, -2,-1};//Knight的八个移动方位  
15. void bfs(int x,int y)  
16. {  
17.     int i;  
18.     node t,p;  
19.     queue<node> q;  
20.     t.x=x;t.y=y;t.num=0;  
21.     memset(map,0,sizeof(map));//每一回合棋盘初始为未被访问状态  
22.     map[t.x][t.y]=1;  
23.     q.push(t);  
24.     while(!q.empty())  
25.     {  
26.         t=q.front();q.pop();  
27.         if(t.x==lx&&t.y==ly)  
28.         {  
29.             printf("To get from %s to %s takes %d knight moves.\n",a,b,t.num);  
30.             return;  
31.         }  
32.         for(i=0;i<8;i++)  
33.         {  
34.             if((t.x+d[i][0]>0)&&(t.x+d[i][0]<9)&&(t.y+d[i][1]>0) //判断移动是否越界  
35.                 &&(t.y+d[i][1]<9)&&!map[t.x+d[i][0]][t.y+d[i][1]])//和移动的格子是否已被访问  
36.             {  
37.                 p.x=t.x+d[i][0];  
38.                 p.y=t.y+d[i][1];  
39.                 p.num=t.num+1;  
40.                 q.push(p);  
41.             }  
42.         }  
43.     }  
44. }  
45. int main()  
46. {  
47.     while(scanf("%s%s",a,b)!=EOF)  
48.     {  
49.         fx=a[0]-'a'+1;fy=a[1]-'0';  
50.         lx=b[0]-'a'+1;ly=b[1]-'0';  
51.         bfs(fx,fy);  
52.     }  
53.     return 0;  
54. }