HDU1372 Knight Moves【BFS】

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.

题目大意：在n*n的棋盘上，按照国际象棋的规则，棋子只能类似马走日的方式在棋盘上行走，求从起点到终点的最短步数。

解题思路：典型的BFS,8个方向

#include <iostream>
#include <queue>
#include <string.h>
using namespace std;

bool inq[8][8]; //记录是否已经入过队
struct node{
	int x,y,step;  //位置和最少步数 
}S,T,Node; //转换为int型起点和终点、临时节点 
char q[5],z[5]; //记录起点和终点
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int x[8]={-2,-2,-1,-1,1,1,2,2};
int y[8]={-1,1,-2,2,-2,2,-1,1};
 //可以走的八个方向 
bool judge(int x,int y){
	if(x<0 || x>7 || y<0 || y>7)  return false;
	if(inq[x][y] == true)  return false;
	return true;
}

int bfs(){
	queue <node> Q;
	Q.push(S);
	inq[S.x][S.y]=true;
	while(!Q.empty())
	{
		node top=Q.front();
		Q.pop();
		if(top.x==T.x && top.y==T.y)
		{
			return top.step;
		}
		for(int i=0;i<8;i++)
		{
			int newX=top.x+x[i];
			int newY=top.y+y[i];
			if(judge(newX,newY))
			{
				Node.x=newX;
				Node.y=newY;
				Node.step=top.step+1;
				Q.push(Node);
				inq[newX][newY] = true;
			} 
		}
	}
	return -1;
}

int main(int argc, char** argv) {
	while(scanf("%s%s",q,z)==2)
	{
		memset(inq,false,sizeof(inq));
		S.x=q[1]-'1',S.y=q[0]-'a';
		S.step=0;
		T.x=z[1]-'1',T.y=z[0]-'a';
		//To get from e2 to e4 takes 2 knight moves.
		cout << "To get from " << q << " to " << z<< " takes "<<bfs()<<" knight moves." << endl ;
		
	}
	 
	return 0;
}