POJ 2243

 #include <iostream>
 #include <queue>
 using namespace std;

 int dir[][] = {-,-,-,,,-,,,,-,-,-,,,-,};

 struct node
 {
     int x;
     int y;
     int step;
     node()
     {
         step = ;
     }
 };

 queue<node> coll;

 bool mark[][];

 node beg;
 node end;

 bool bfs(node p);

 int main()
 {
     //freopen("acm.acm","r",stdin);
     char s_1[];
     char s_2[];

     while(cin>>s_1>>s_2)
     {
         memset(mark,false,sizeof(mark));
         beg.x = s_1[] - 'a';
         beg.y = s_1[] - '' - ;

         end.x = s_2[] - 'a';
         end.y = s_2[] - '' - ;
         coll.push(beg);
         mark[beg.x][beg.y] = true;
         cout<<"To get from "<<s_1<<" to "<<s_2<<" takes ";

         while(!coll.empty() && !bfs(coll.front()))
         {
             coll.pop();
         }
         while(!coll.empty())
         {
             coll.pop();
         }
         cout<<" knight moves."<<endl;
     }
 }

 bool bfs(node p)
 {
     int i;
     int j;
     if(p.x == end.x && p.y == end.y)
     {
         cout<<p.step;
         return true;
     }
     int tem_i;
     int tem_j;
     node tem;

     for(i = ; i < ; ++ i)
     {
         tem_i = p.x + dir[i][];
         tem_j = p.y + dir[i][];
         if(tem_i >=  && tem_i <  && tem_j >=  && tem_j <  && !mark[tem_i][tem_j])
         {
             tem.x = tem_i;
             tem.y = tem_j;
             tem.step = p.step + ;
             mark[tem_i][tem_j] = true;
             coll.push(tem);
         }
     }
     return false;
 }

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com