C++实现键盘上下左右老鼠走迷宫

《C++实现键盘上下左右老鼠走迷宫》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、//migong.cpp:定¨义?控?制?台?应畖用?程ì序ò的?入?口ú点?。￡//#include"stdafx.h"#include#include#includeusingnamespacestd;#defineMaxSize100#defineMAXROW14voidmgij();intmg[MAXROW][MAXROW]={{1,1,1,1,1,1,1,1,1,1,1,1,1,0},{1,0,0,0,0,0,0,0,0,1,0,0,1,1},{1,0,1,1,0,1,1,0,0,0,0,0,1,2},{1,0,

2、0,0,0,0,1,0,0,0,1,0,1,3},{1,1,1,0,1,1,1,0,1,1,0,1,1,4},{1,0,1,0,0,0,0,0,1,0,0,1,1,5},{1,0,1,1,0,1,0,1,1,1,0,0,1,6},{1,0,0,0,0,1,0,0,0,0,0,1,1,7},{1,0,1,1,0,1,0,1,1,1,0,0,1,8},{1,0,1,1,0,0,0,0,1,0,0,0,1,9},{1,0,0,0,0,1,0,0,1,0,0,1,1,10},{1,0,0,0,0,1,0,0,1,0,0,0,1,11},{1,1,1,1,1,1,1,1,1,1,1,1,1

3、,0},{0,1,2,3,4,5,6,7,8,9,10,11,0,0}};structBox{inti,j,pre;};structQuType{Boxdata[MaxSize];intfront,rear;};voidprint(QuTypequ,intfront)//输?出?坐?标括?路·径?;{intk=front,j,l=0,ns=0;do//反ぁ?向ò找ò到?最?短ì的?路·径?，?将?该?路·径?上?的?方?块é的?pre成é员±设Θ?置?成é-1;{l++;j=k;//该?句?不?能ü省?略?。￡第台?二t次?执′行D时骸?，?j等台?于?下?句?求ó出?的?当獭

4、纊先è前°入?队ó尾2时骸?出?队ó的?front;k=qu.data[k].pre;//qu.data[qu.rear].pre=qu.front,求ó当獭纊先è前°入?队ó尾2时骸?出?队ó的?front;qu.data[j].pre=-1;//该?句?不?能ü移?到?上?句?之?前°;}while(k!=0);cout<

5、a[k].pre==-1){ns++;cout<<"("<

6、在ú设Θ?计?迷?宫?时骸?已?造ì好?;{for(j=0;j

7、f(mg[i][j]==-1)//数簓字?-1用?来ぁ?表括?示?可é通?行D"◇ó";cout<<"◇ó";elsecout<<"";}if(0