算法题 深/广搜-04-Knight Moves

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.

思路：这题关键是要知道国际象棋中的骑士是如何走的，在运用BFS来求解即可

手画的有点丑，见谅。当我们知道骑士如何走的时候就很好A题了，用BFS即可

#include
#include
#include
const int INF = 100000000;
using namespace std;
int move1[8][2] = { {1,2},{1,-2},{-1,2},{-1,-2},{2,1},{2, - 1},{-2,1},{-2,-1} };
int d[15][15];
struct node {
	int x, y;
};
int bfs(node star,node end1) {
	queue q;
	node  next,now;
	for (int i1 = 0; i1 <8; i1++) {
		for (int j1 = 0; j1 < 8; j1++) {
			d[i1][j1] = INF;
		}
	}
	q.push(star);
	d[star.x][star.y] = 0;
	while (!q.empty()) {
		now = q.front();
		q.pop();
		if (now.x == end1.x&&now.y == end1.y) {
				break;
		}
		for (int k=0; k < 8; k++) {
			next.x = now.x + move1[k][0];
			next.y = now.y + move1[k][1];	
			if (next.x >= 0 && next.y >= 0 && next.x <8&&next.y <8&&d[next.x][next.y]==INF) {
				q.push(next);
				d[next.x][next.y] = d[now.x][now.y] + 1;
			}
		}
	}
	return d[end1.x][end1.y];
}
int main() {
	char s[5], g[5];
	node begin,end;
	int ans;
	while (cin >> s >> g) {
		begin.x = s[0] - 'a';
		begin.y = s[1] - '1';
		end.x = g[0] - 'a';
		end.y = g[1] - '1';
		if (s == g) {
			cout << "To get from " << s << " to " << g << " takes 0 knight moves." << endl;
		}
		else {
			ans = bfs(begin, end);
			cout << "To get from " << s << " to " << g << " takes " << ans<<" knight moves."<