C语言开发中迷宫游戏的实现操作

#include 
#include 
#include 
using namespace std;
class node
{
public:
  int x,y;
  int lastOpt;
};
deque sta;
int x,y;
int endx,endy;
int mapW,mapH;
int steps;
int xopt[5]= {0,0,1,0,-1};
int yopt[5]= {0,1,0,-1,0};
int map[100][100]=
{
 
};
void init()
{
  x = 1;
  y = 1;
  endx = 1;
  endy = 9;
  mapH = 10;
  mapW = 10;
  for(int i=0; i steps:%d Exit:(%d,%d)\n",steps,endx,endy);
  map[x][y] = ori;
}
int can(int n)
{
  if(map[x+xopt[n]][y+yopt[n]] == 0 || map[x+xopt[n]][y+yopt[n]] == 5)
    return 1;
  return 0;
 
}
void visit(int n)
{
  map[x][y]=2;
  x+=xopt[n];
  y+=yopt[n];
  node tem;
  tem.x = x;
  tem.y = y;
  tem.lastOpt = n;
  sta.push_back(tem);
  steps++;
}
int main()
{
  init();
  node tem;
  while( x != endx || y!=endy)
  {
 
    int cans = 0;
    for(int i=1; i i am finished....\n";
  else
  cout i am finished...but i can't find the right way\n";
  return 0;
}