SnakeGame/Snake_map.cpp at main · overhyeon/SnakeGame · 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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include <iostream>
#include "Snake_map.h"
bool waitRandomWall = 1;
int forRandomWall = 5;
int stage = 0;
bool waitGate = 1;
int forGate = 7;
int gate[2][GATE_SIZE] = { { 0, 0 }, { 0, 0 } };
int map[MAP_SIZE][MAP_SIZE];
void map_init(int stage) {
    for (int i = 0; i < MAP_SIZE; i++) {
        for (int j = 0; j < MAP_SIZE; j++) {
            map[i][j] = 0;
        }
    }
    for (int i = 0; i < MAP_SIZE; i++) {
        map[i][MAP_SIZE - 1] = WALL;
        map[i][0] = WALL;
        map[MAP_SIZE - 1][i] = WALL;
        map[0][i] = WALL;
    }

    map[MAP_SIZE / 2][MAP_SIZE / 2] = SNAKE_BODY;
    map[MAP_SIZE / 2][MAP_SIZE / 2 + 1] = SNAKE_BODY;
    map[MAP_SIZE / 2][MAP_SIZE / 2 - 1] = SNAKE_BODY;


    if (stage == 1) {
        for (int i = 0; i < 10; i++) {
            map[i][8] = 2;
        }
    }
    else if (stage == 2) {
        for (int i = 5; i < 14; i++) {
            map[5][i] = 2;
        }

        for (int i = 5; i < 14; i++) {
            map[i][5] = 2;
        }
    }
    else if (stage == 3) {
        for (int i = 2; i < 15; i++) {
            map[i][i] = 2;
        }
    }
    else if (stage == 4) {
        for (int i = 0; i < MAP_SIZE; i++)
        {
            for (int j = 0; j < MAP_SIZE; j++)
            {
                if (i % 2 == 1 && j % 2 == 1)
                {
                    map[i][j] = 2;
                }
            }
        }
    }


    findImmuneWall();
}


void findImmuneWall() {
    int dy[4] = { 0,1,0,-1 };
    int dx[4] = { 1,0,-1,0 };

    for (int i = 0; i < MAP_SIZE; i++) {
        for (int j = 0; j < MAP_SIZE; j++) {
            if (map[i][j] == 2) {

                int cnt = 0;
                for (int k = 0; k < 4; k++) {
                    int ny = i + dy[k];
                    int nx = j + dx[k];

                    if (ny < 0 || ny >= MAP_SIZE || nx < 0 || nx >= MAP_SIZE) continue;
                    if (map[ny][nx] != 1 && map[ny][nx] != 2) cnt++;
                }


                if (cnt == 0) map[i][j] = 1;
            }
        }
    }
}


void makeGate() {
    int x1 = rand() % MAP_SIZE;
    int y1 = rand() % MAP_SIZE;

    int x2 = rand() % MAP_SIZE;
    int y2 = rand() % MAP_SIZE;

    while (map[y1][x1] != 2) {
        x1 = rand() % MAP_SIZE;
        y1 = rand() % MAP_SIZE;
    }

    map[y1][x1] = GATE;

    while (map[y2][x2] != 2) {
        x2 = rand() % MAP_SIZE;
        y2 = rand() % MAP_SIZE;
    }

    map[y2][x2] = GATE;

    gate[0][0] = y1;
    gate[0][1] = x1;
    gate[1][0] = y2;
    gate[1][1] = x2;
}

void makeRandomWall()
{
    for (size_t i = 0; i < 15; i++)
    {
        int x1, y1;

        do
        {
            x1 = rand() % MAP_SIZE;
            y1 = rand() % MAP_SIZE;
        } while (map[y1][x1] != 0);

        map[y1][x1] = 2;
    }

}