ZOJ Problem Set - 1091 Knight Moves

BFS骑士走棋算法

最新推荐文章于 2022-02-25 19:38:17 发布

原创最新推荐文章于 2022-02-25 19:38:17 发布 · 611 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

ACM题解专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个使用广度优先搜索(BFS)结合标准模板库(STL)中的队列实现的骑士走棋算法示例。该算法用于计算骑士从一个棋盘位置到另一个位置所需的最少步数。

BFS+STL-queue教学级题目

#include<iostream> #include<queue> using namespace std; struct point { int x; int y; int step; }st,et; int mp[10][10]; queue<point>mv; void visit() { point pp; if(mv.front().x+1<9&&mv.front().y-2>0&&mp[mv.front().x+1][mv.front().y-2]==0) { mp[mv.front().x+1][mv.front().y-2]=1; pp.x=mv.front().x+1; pp.y=mv.front().y-2; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x+2<9&&mv.front().y-1>0&&mp[mv.front().x+2][mv.front().y-1]==0) { mp[mv.front().x+2][mv.front().y-1]=1; pp.x=mv.front().x+2; pp.y=mv.front().y-1; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x+2<9&&mv.front().y+1<9&&mp[mv.front().x+2][mv.front().y+1]==0) { mp[mv.front().x+2][mv.front().y+1]=1; pp.x=mv.front().x+2; pp.y=mv.front().y+1; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x+1<9&&mv.front().y+2<9&&mp[mv.front().x+1][mv.front().y+2]==0) { mp[mv.front().x+1][mv.front().y+2]=1; pp.x=mv.front().x+1; pp.y=mv.front().y+2; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x-1>0&&mv.front().y+2<9&&mp[mv.front().x-1][mv.front().y+2]==0) { mp[mv.front().x-1][mv.front().y+2]=1; pp.x=mv.front().x-1; pp.y=mv.front().y+2; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x-2>0&&mv.front().y+1<9&&mp[mv.front().x-2][mv.front().y+1]==0) { mp[mv.front().x-2][mv.front().y+1]=1; pp.x=mv.front().x-2; pp.y=mv.front().y+1; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x-2>0&&mv.front().y-1>0&&mp[mv.front().x-2][mv.front().y-1]==0) { mp[mv.front().x-2][mv.front().y-1]=1; pp.x=mv.front().x-2; pp.y=mv.front().y-1; pp.step=mv.front().step+1; mv.push(pp); } if(mv.front().x-1>0&&mv.front().y-2>0&&mp[mv.front().x-1][mv.front().y-2]==0) { mp[mv.front().x-1][mv.front().y-2]=1; pp.x=mv.front().x-1; pp.y=mv.front().y-2; pp.step=mv.front().step+1; mv.push(pp); } } int BFS() { st.step=0; mv.push(st); while(!mv.empty()) { if(mv.front().x==et.x&&mv.front().y==et.y)return mv.front().step; visit(); mv.pop(); } } int main() { char a,b; int m; char buf1[100],buf2[100]; while(scanf("%s %s",buf1,buf2)!=EOF) { sscanf(buf1,"%c%d",&a,&st.y); sscanf(buf2,"%c%d",&b,&et.y); st.x=a-'a'+1; et.x=b-'a'+1; memset(mp,0,sizeof(mp)); m=BFS(); printf("To get from %c%d to %c%d takes %d knight moves./n",a,st.y,b,et.y,m); while(!mv.empty()) mv.pop(); } return 0; }