Knight Moves bfs
来源:互联网 发布:js设置时间间隔 编辑:程序博客网 时间:2024/05/01 01:26
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.
给起点和终点的bfs,注意字符处理,相当于变成坐标。
#include<stdio.h>#include<string.h>#include<queue>using namespace std;char s1[5],s2[5];int map[10][10];int to[8][2]={1,2,1,-2,-1,2,-1,-2,2,1,2,-1,-2,-1,-2,1};int ex,ey,st;struct node{ int x,y,st;};int check(node p){ if(p.x<0||p.x>=8||p.y<0||p.y>=8||map[p.x][p.y]) return 1; return 0;}int bfs(){ int i; node a,b,p; queue<node>q; a.x=s1[0]-'a'; a.y=s1[1]-'1'; a.st=0; ex=s2[0]-'a'; ey=s2[1]-'1'; memset(map,0,sizeof map); map[a.x][a.y]=1; q.push(a); while(!q.empty()) { b=q.front(); q.pop(); if(b.x==ex&&b.y==ey) return b.st; for(i=0;i<8;i++) { p.x=b.x+to[i][0]; p.y=b.y+to[i][1]; if(check(p)) continue; p.st=b.st+1; map[p.x][p.y]=1; q.push(p); } }}int main(){ while(~scanf("%s%s",s1,s2)) { printf("To get from %s to %s takes %d knight moves.\n",s1,s2,bfs()); } return 0;}
0 0
- Knight Moves hdu1372 bfs
- poj2243 Knight Moves (BFS)
- 【BFS】Knight Moves
- 1372 knight moves BFS
- Knight Moves(bfs)
- 1030 Knight Moves:BFS
- 439 - Knight Moves//bfs
- Knight Moves BFS
- HDU1372:Knight Moves(BFS)
- hdu1372 Knight Moves (BFS)
- Knight Moves hdu BFS
- Knight Moves(BFS)
- POJ1915:Knight Moves(BFS)
- Knight Moves ---BFS模板
- Knight Moves ---BFS模板
- POJ_1915_Double BFS Knight Moves
- HDU1372:Knight Moves(BFS)
- Knight Moves bfs
- java解决大数相加
- 盘点前10名的免费跨浏览器测试工具
- C语言实现文件加密解密
- android sdk manager 下面 安卓版本 很少
- 2014年50个程序员最适用的免费JQuery插件
- Knight Moves bfs
- 大姚土豆丝
- atol()函数一个可移植的版本
- 城堡(简单但费时)
- 60个很实用的jQuery代码开发技巧收集
- STL 函数对象
- C语言 键盘编码 及 用法
- 侃侃Thinking In Java
- NYOJ 811 变态最大值