Lab/Rat_in_a_maze.cpp at master · Darren2017/Lab · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
using namespace std;
#define N 5

int maze[N][N] = {
    {1, 0, 0, 0, 1},
    {1, 1, 1, 1, 1},
    {0, 1, 0, 0, 1},
    {1, 0, 0, 1, 1},
    {0, 1, 1, 1, 1}
};

int pace[N][N] = {
    {0, 0, 0, 0, 0},
    {0, 0, 0, 0, 0},
    {0, 0, 0, 0, 0},
    {0, 0, 0, 0, 0},
    {0, 0, 0, 0, 0}
};

bool Maze(int x, int y);
void print();
bool isSafe(int x, int y);

int main()
{
    Maze(0, 0);
    return 0;
}

bool Maze(int x, int y){
    if(x == N -1 && y == N - 1){
        pace[x][y] = 1;
        print();
        return true;
    }
    if(isSafe(x, y) == true){
        pace[x][y] = 1;
        if(Maze(x + 1, y) == true){
            return true;
        }
        if(Maze(x, y + 1) == true){
            return true;
        }
    }
    pace[x][y] = 0;

    return false;
}

void print(){
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            printf("%-3d", pace[i][j]);
        }
        printf("\n");
    }
}

bool isSafe(int x, int y)
{
    if(x >= 0 && x < N && y >= 0 && y < N && maze[x][y] == 1){
        return true;
    }
    return false;
}