POJ 2243 - Knight Moves (A*)
来源:互联网 发布:js仿京东商品详情 编辑:程序博客网 时间:2024/06/06 04:27
B - Knight Moves
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uAppoint description:
Description
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.
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 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 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 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 <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;#define N 10struct node{ int f,g,h; int x,y,s; friend bool operator <(const node &a,const node &b){ return a.f>b.f; }};char a,c;int b,d;int fx,fy,ex,ey;bool vis[N][N];priority_queue<node> q;int vx[]={1,1,2,2,-1,-1,-2,-2};int vy[]={2,-2,1,-1,2,-2,1,-1};bool check(int x,int y){ if (x<0 || x>7 || y<0 || y>7) return false; return true;}int Heuristic(node a){ return (abs(a.x-ex)+abs(a.y-ey))*10;}int bfs(){ while (!q.empty()) q.pop(); memset(vis,0,sizeof(vis)); node cur,com; cur.x=fx; cur.y=fy; cur.s=cur.g=0; cur.h=Heuristic(cur); cur.f=cur.g+cur.h; q.push(cur); while (!q.empty()){ cur=q.top(); q.pop(); vis[cur.x][cur.y]=1; if (cur.x==ex && cur.y==ey) return cur.s; for (int i=0;i<8;i++){ com=cur; com.x+=vx[i]; com.y+=vy[i]; com.s++; if (check(com.x,com.y) && !vis[com.x][com.y]){ com.g+=23; com.h=Heuristic(com); com.f=com.g+com.h; q.push(com); } } } return -1;}int main(){ while (scanf("%c%d %c%d",&a,&b,&c,&d)!=EOF){ getchar(); fx=a-'a'; fy=b-1; ex=c-'a'; ey=d-1; //cout<<fx<<fy<<' '<<ex<<ey<<endl; int ans=bfs(); printf("To get from %c%d to %c%d takes %d knight moves.\n",a,b,c,d,ans); } return 0;}
0 0
- POJ 2243 Knight Moves A*
- POJ 2243 - Knight Moves (A*)
- POJ 2243 Knight Moves【BFS|A*】
- POJ 2243 Knight Moves(A*算法)
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- poj 2243 Knight Moves
- poj 2243 Knight Moves
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- POJ-2243-Knight Moves
- poj 2243 Knight Moves
- poj 2243:Knight Moves
- POJ 2243 Knight Moves
- poj-- 2243 Knight Moves
- POJ 2243 Knight Moves
- javascript笔记之express初体验
- UIFont 兼容所以版本
- 表单异步提交不返回响应数据总结
- 从网上获取数据转换成byte[]数组
- 62.Odd Even Linked List
- POJ 2243 - Knight Moves (A*)
- hdu2050
- 5.6 array--高效的数值类型数组
- [微积分学习]Day 6.数列的极限
- 线段树系列(数据结构)
- Session对象不必须依赖Cookie
- redis问题
- 聊一聊Android 6.0的运行时权限
- [ZJOI 2013] bzoj3110 K大数查询 (整体二分)