简单迷宫游戏2

1.本程序对上一个程序进行了改进，每次人工走的迷宫都能通过。这块通过函数void findway(int x, int y);的，当迷宫能走通时，tmpt1值由0变为1，而这个函数相对有些复杂，也运用了递归，如果能对递归有一定了解的话还是比较容易的。要注意的是在main函数case'1'中要记得将tempt1归零。还有，要是把生成迷宫的函数放在main函数中，当迷宫走不通要循环时要记得将srand(time(NULL))放在循环中，否则的话每次生成的地图都一样。

函数体如下：

#include<iostream>
#include<ctime>
#include<cstdlib>
#include<conio.h>


using namespace std;


#define Max 7   //迷宫的大小
#define Key 2   //解中线路标记数字
#define Exit1 Max-1    //出口横坐标
#define Exit2 Max-1   //出口纵坐标
#define Entrance1 0    //入口横坐标
#define Entrance2 0    //入口纵坐标
int tmpt1 = 0;         //标记看生成的迷宫是否走得通，通则为1，否则为0


int b[Max][Max];
int graph[Max][Max];


void menu();                  //菜单
void maprand();               //生成迷宫
void prmap(int x, int y);     //显示迷宫
bool walk(int x, int y);      //是否可走
bool walk_n(int x, int y);    //判断上是否可走
bool walk_s(int x, int y);    //下
bool walk_w(int x, int y);    //左
bool walk_e(int x, int y);    //右
bool walk_se(int x, int y);   //右下
bool walk_sw(int x, int y);   //左下
bool walk_nw(int x, int y);   //左上
bool walk_ne(int x, int y);   //右上
void findway(int x, int y);   //自动探索
void peoplefind();            //人工探索




int main() {
while (1) {
        menu();
char choice = getch();
loop:maprand();
switch(choice) {
case '1':
tmpt1 = 0;
findway(Entrance1, Entrance2);
if (tmpt1 == 0) {
choice = '1';
goto loop;
}
peoplefind();
break;
case '2':
system("cls");
break;
case '3':
return 0;
default: break;
}
}
}




void menu() {
    cout << "1:人工探索模式(如果无解则按‘0’返回上一级)。" << endl;
    cout << "2:清屏。" << endl;
    cout << "3:退出。" << endl;
}


void maprand() {
        srand(time(NULL));
    for (int i=0; i<Max; i++)
        for(int j=0; j<Max; j++) {
            graph[i][j] = rand()%2;
            graph[0][0] = 1;
            graph[Exit1][Exit2] = 1;
            b[i][j] = 0;
        }
}


void prmap(int x, int y ) {
for (int j=0; j<Max; j++)
cout << "__";
cout << endl;
for (int i=0; i<Max; i++) {
cout << "|";
for (int j=0; j<Max; j++) {
graph[0][0] = 1;
graph[Max-1][Max-1] = 1;
if (i == x && j == y) {
if (y == Max-1)
cout << "!";
else
cout << "! ";
continue;
}
if (graph[i][j] == 0) {
if (j == Max-1)
cout << "X";
else
cout << "X ";
} else
if (j == Max-1)
cout << " ";
else
cout << "  ";
}
cout << "|" << endl;
}
for (int p=0; p<Max; p++)
cout << "--";
cout << endl;
}


void peoplefind() {
int x=Entrance1, y=Entrance2;
prmap(x, y);
char a;
while (1) {
a = getch();
switch(a) {
case 'a':
if (walk(x, y-1)) {
system("cls");
menu();
prmap(x, y-1);
x = x;
y = y-1;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'd':
if (walk(x, y+1)) {
system("cls");
menu();
prmap(x, y+1);
x = x;
y = y+1;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'w':
if (walk(x-1, y)) {
system("cls");
menu();
prmap(x-1, y);
x = x-1;
y = y;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'x':
if (walk(x+1, y)) {
system("cls");
menu();
prmap(x+1, y);
x = x+1;
y = y;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'q':
if (walk(x-1, y-1)) {
system("cls");
menu();
prmap(x-1, y-1);
x = x-1;
y = y-1;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'e':
if (walk(x-1, y+1)) {
system("cls");
menu();
prmap(x-1, y+1);
x = x-1;
y = y+1;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'z':
if (walk(x+1, y-1)) {
system("cls");
menu();
prmap(x+1, y-1);
x = x+1;
y = y-1;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case 'c':
if (walk(x+1, y+1)) {
system("cls");
menu();
prmap(x+1, y+1);
x = x+1;
y = y+1;
if (x == Exit1 && y == Exit2) {
cout << "you are great!!\n\n\n";
return;
}
}
break;
case '0':
return;
default:
break;
}
}
}


void findway(int x, int y) {
    b[x][y] = Key;
    if (x == Exit1 && y == Exit2) {
        b[x][y] = Key;
tmpt1 = 1;
    }


    if (walk_n(x-1, y)) {
        b[x-1][y] = Key;
        findway(x-1, y);
        b[x-1][y] = 3;
    }
    if (walk_s(x+1, y)) {
        b[x+1][y] = Key;
        findway(x+1,  y);
        b[x+1][y] = 3;
    }
    if (walk_w(x, y-1)) {
        b[x][y-1] = Key;
        findway(x, y-1);
        b[x][y-1] = 3;
    }
    if (walk_e(x, y+1)) {
        b[x][y+1] = Key;
        findway(x, y+1);
        b[x][y+1] = 3;
    }
    if (walk_nw(x-1, y-1)) {
        b[x-1][y-1] = Key;
        findway(x-1, y-1);
        b[x-1][y-1] = 3;
    }
    if (walk_ne(x-1, y+1)) {
        b[x-1][y+1] = Key;
        findway(x-1, y+1);
        b[x-1][y+1] = 0;
    }
    if (walk_sw(x+1, y-1)) {
        b[x+1][y-1] = Key;
        findway(x+1, y-1);
        b[x+1][y-1] = 0;
    }
    if (walk_se(x+1, y+1)) {
        b[x+1][y+1] = Key;
        findway(x+1, y+1);
        b[x+1][y+1] = 0;
    }
}




bool walk(int x, int y) {
if (x<0 || x>=Max || y<0 || y>=Max)
return false;
if (graph[x][y] == 0)
return false;
return true;
}




bool walk_n(int x, int y) {
if (x<0)
        return false;
    if (b[x][y] == 3 || b[x][y] == Key || graph[x][y] == 0)
        return false;
    return true;
}


bool walk_s(int x, int y) {
if (x>=Max)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}


bool walk_w(int x, int y) {
if (y<0)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}


bool walk_e(int x, int y) {
if (y>=Max)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}


bool walk_se(int x, int y) {
if (x>=Max || y>=Max)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}
bool walk_sw(int x, int y) {
if (x>=Max || y<0)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}


bool walk_nw(int x, int y) {
if (x<0 || y<0)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}


bool walk_ne(int x, int y) {
if (y>=Max || x<0)
        return false;
    if (b[x][y] == 3 || b[x][y] == 2 || graph[x][y] == 0)
        return false;
    return true;
}