uva 439 Knight Moves

最新推荐文章于 2022-08-31 15:02:21 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2022-08-31 15:02:21 发布

阅读量441

点赞数

分类专栏：经典例题文章标签： uva bfs

本文链接：https://blog.csdn.net/tengfei461807914/article/details/52319428

版权

经典例题专栏收录该内容

39 篇文章 0 订阅

订阅专栏

原题：
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.

中文：
经典的骑士巡游问题，题目就不介绍了，没做过算是遗憾。

#include <bits/stdc++.h>
using namespace std;
struct point
{
    int x,y,pace;
};
bool vis[15][15];
string s1,s2;
int Move[8][2]={{1,2},{1,-2},{-1,2},{-1,-2},{2,1},{2,-1},{-2,1},{-2,-1}};
bool judge(point tmp)
{
    if(tmp.x>=1&&tmp.x<=8&&tmp.y>=1&&tmp.y<=8)
        return true;
    return false;
}
int bfs(point start,point End)
{
    queue<point> Q;
    memset(vis,false,sizeof(vis));
    Q.push(start);
    while(!Q.empty())
    {
        point tmp=Q.front();
        Q.pop();
        for(int i=0;i<8;i++)
        {
            int x=tmp.x+Move[i][0],y=tmp.y+Move[i][1],z=tmp.pace+1;
            point res;
            res.x=x,res.y=y,res.pace=z;
            if(judge(res))
            {
                if(x==End.x&&y==End.y)
                    return res.pace;
                if(!vis[x][y]&&judge(res));
                {
                    vis[x][y]=1;
                    Q.push(res);
                }
            }
        }
    }
    return -1;
}
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>s1>>s2)
    {
        if(s1==s2)
        {
            cout<<"To get from "<<s1<<" to "<<s2<<" takes "<<0<<" knight moves."<<endl;
            continue;
        }
        point s,e;
        s.x=s1[0]-'a'+1;
        s.y=s1[1]-'0';
        s.pace=0;
        e.x=s2[0]-'a'+1;
        e.y=s2[1]-'0';
        e.pace=0;
        vis[s.x][s.y]=1;

        int ans=bfs(s,e);
        cout<<"To get from "<<s1<<" to "<<s2<<" takes "<<ans<<" knight moves."<<endl;
    }
    return 0;
}