UVA439 knightMoves (A*启发搜索)

第一个A*，纪念下。

A*要保证最短路一定要估价函数小于等于实际值，越接近越好

估价函数取Manhattan距离除以二。

//Rey

#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = ;
bool C[N][N];
struct node
{
   int g,h;
   int x, y;
   bool operator < (const node& rhs) const{
      if(g + h > rhs.g + rhs.h) return true;
      if(g + h < rhs.h + rhs.g ) return false;
      return g > rhs.g;
   }
};

int tax,tay;

inline void getH(node& o)
{
   o.h = (abs(o.x-tax)+abs(o.y-tay))>>;
}

#define joinC(n) C[n.x][n.y] = true
int dx[] = {,, , ,-,-,-,-};
int dy[] = {,,-,-,-,-, , };

int bfs(node &start)
{
   priority_queue<node> Q;
   memset(C,false,sizeof(C));
   Q.push(start);
   joinC(start);
   node cur,nxt;
   int i,nx,ny;
   while(Q.size()){
      cur = Q.top();Q.pop();
      if(cur.x == tax && cur.y == tay) return cur.g;
      for(i = ; i < N; i++){
         nx = cur.x + dx[i];
         ny = cur.y + dy[i];
         if(nx >= N || nx <  || ny >= N || ny <  || C[nx][ny]) continue;
         nxt.x = nx ; nxt.y = ny; nxt.g = cur.g+ ; getH(nxt);
         joinC(nxt);
         Q.push(nxt);
      }
   }
   return -;
}

int main()
{
   node start;
   char fro[],to[];
   char ch;
   int n;
   while(~scanf("%s",fro)){
      scanf("%s",to);
      sscanf(fro,"%c",&ch);
      sscanf(fro+,"%1d",&n);
      start.x = ch -'a';
      start.y = n-;
      start.g = ;
      sscanf(to,"%c",&ch);
      sscanf(to+,"%1d",&n);
      tax = ch - 'a';
      tay = n-;
      getH(start);
      printf("To get from %s to %s takes %d knight moves.\n",fro,to,bfs(start));
   }
   return ;
}