aoc2022-python/23.py at main · BurgundyDev/aoc2022-python · 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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
elves = []

moves = {
    'N': [0, -1],
    'S': [0, 1],
    'E': [1, 0],
    'W': [-1, 0],
    'NE': [1, -1],
    'NW': [-1, -1],
    'SE': [1, 1],
    'SW': [-1, 1]
}

for y, line in enumerate(open("23.txt")):
    for x, char in enumerate(line):
        if char == '#':
            elves.append([x, y])
ans2 = 0
def answer():
    min_x = 10000000000
    max_x = -10000000000
    min_y = 10000000000
    max_y = -10000000000
    for elf in elves:
        if elf[0] < min_x:
            min_x = elf[0]
        if elf[0] > max_x:
            max_x = elf[0]
        if elf[1] < min_y:
            min_y = elf[1]
        if elf[1] > max_y:
            max_y = elf[1]

    width = max_x - min_x + 1
    height = max_y - min_y + 1
    ans = (width * height) - len(elves) - 1
    # print(ans)
moving = [True for _ in range(len(elves))]
while True:
    moving = [False for _ in range(len(elves))]
    proposed_moves = [[] for _ in range(len(elves))]

    for i, elf in enumerate(elves):
        # print(elf)
        elf_moves = {key: [elf[0] + x[0], elf[1] + x[1]] for key, x in moves.items()}
        for key, move in elf_moves.items():
            if elves.count(move) > 0:
                moving[i] = True
                break

        if moving[i]:
            if elves.count(elf_moves['N']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['NW']) == 0:
                proposed_moves[i] = elf_moves['N']
            elif elves.count(elf_moves['S']) == 0 and elves.count(elf_moves['SE']) == 0 and elves.count(elf_moves['SW']) == 0:
                proposed_moves[i] = elf_moves['S']
            elif elves.count(elf_moves['W']) == 0 and elves.count(elf_moves['NW']) == 0 and elves.count(elf_moves['SW']) == 0:
                proposed_moves[i] = elf_moves['W']
            elif elves.count(elf_moves['E']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['SE']) == 0:
                proposed_moves[i] = elf_moves['E']

    if moving.count(True) == 0:
        break
    for i, move in enumerate(proposed_moves):
        if proposed_moves.count(move) == 1:
            continue
        else:
            for x, elem in enumerate(proposed_moves):
                if move == elem:
                    proposed_moves[x] = []
            proposed_moves[i] = []

    for i, elf in enumerate(elves):
        if len(proposed_moves[i]) == 2:
            elves[i] = [proposed_moves[i][0], proposed_moves[i][1]]

    answer()
    ans2 += 1

    moving = [False for _ in range(len(elves))]
    proposed_moves = [[] for _ in range(len(elves))]
    for i, elf in enumerate(elves):
        moving[i] = False
        # print(elf)
        elf_moves = {key: [elf[0] + x[0], elf[1] + x[1]] for key, x in moves.items()}
        for key, move in elf_moves.items():
            if elves.count(move) > 0:
                moving[i] = True
                break

        if moving[i]:
            if elves.count(elf_moves['S']) == 0 and elves.count(elf_moves['SE']) == 0 and elves.count(elf_moves['SW']) == 0:
                proposed_moves[i] = elf_moves['S']
            elif elves.count(elf_moves['W']) == 0 and elves.count(elf_moves['NW']) == 0 and elves.count(elf_moves['SW']) == 0:
                proposed_moves[i] = elf_moves['W']
            elif elves.count(elf_moves['E']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['SE']) == 0:
                proposed_moves[i] = elf_moves['E']
            elif elves.count(elf_moves['N']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['NW']) == 0:
                proposed_moves[i] = elf_moves['N']

    if moving.count(True) == 0:
        break
    for i, move in enumerate(proposed_moves):
        if proposed_moves.count(move) == 1:
            continue
        else:
            for x, elem in enumerate(proposed_moves):
                if move == elem:
                    proposed_moves[x] = []
            proposed_moves[i] = []

    for i, elf in enumerate(elves):
        if len(proposed_moves[i]) == 2:
            elves[i] = [proposed_moves[i][0], proposed_moves[i][1]]

    answer()
    ans2 += 1

    moving = [False for _ in range(len(elves))]
    proposed_moves = [[] for _ in range(len(elves))]
    for i, elf in enumerate(elves):
        moving[i] = False
        # print(elf)
        elf_moves = {key: [elf[0] + x[0], elf[1] + x[1]] for key, x in moves.items()}
        for key, move in elf_moves.items():
            if elves.count(move) > 0:
                moving[i] = True
                break

        if moving[i]:
            if elves.count(elf_moves['W']) == 0 and elves.count(elf_moves['NW']) == 0 and elves.count(elf_moves['SW']) == 0:
                proposed_moves[i] = elf_moves['W']
            elif elves.count(elf_moves['E']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['SE']) == 0:
                proposed_moves[i] = elf_moves['E']
            elif elves.count(elf_moves['N']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['NW']) == 0:
                proposed_moves[i] = elf_moves['N']
            elif elves.count(elf_moves['S']) == 0 and elves.count(elf_moves['SE']) == 0 and elves.count(elf_moves['SW']) == 0:
                    proposed_moves[i] = elf_moves['S']

    if moving.count(True) == 0:
        break
    for i, move in enumerate(proposed_moves):
        if proposed_moves.count(move) == 1:
            continue
        else:
            for x, elem in enumerate(proposed_moves):
                if move == elem:
                    proposed_moves[x] = []
            proposed_moves[i] = []

    for i, elf in enumerate(elves):
        if len(proposed_moves[i]) == 2:
            elves[i] = [proposed_moves[i][0], proposed_moves[i][1]]

    answer()
    ans2 += 1

    moving = [False for _ in range(len(elves))]
    proposed_moves = [[] for _ in range(len(elves))]
    for i, elf in enumerate(elves):
        moving[i] = False
        # print(elf)
        elf_moves = {key: [elf[0] + x[0], elf[1] + x[1]] for key, x in moves.items()}
        for key, move in elf_moves.items():
            if elves.count(move) > 0:
                moving[i] = True
                break

        if moving[i]:
            if elves.count(elf_moves['E']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['SE']) == 0:
                proposed_moves[i] = elf_moves['E']
            elif elves.count(elf_moves['N']) == 0 and elves.count(elf_moves['NE']) == 0 and elves.count(elf_moves['NW']) == 0:
                proposed_moves[i] = elf_moves['N']
            elif elves.count(elf_moves['S']) == 0 and elves.count(elf_moves['SE']) == 0 and elves.count(elf_moves['SW']) == 0:
                    proposed_moves[i] = elf_moves['S']
            elif elves.count(elf_moves['W']) == 0 and elves.count(elf_moves['NW']) == 0 and elves.count(elf_moves['SW']) == 0:
                proposed_moves[i] = elf_moves['W']

    if moving.count(True) == 0:
        break
    for i, move in enumerate(proposed_moves):
        if proposed_moves.count(move) == 1:
            continue
        else:
            for x, elem in enumerate(proposed_moves):
                if move == elem:
                    proposed_moves[x] = []
            proposed_moves[i] = []

    for i, elf in enumerate(elves):
        if len(proposed_moves[i]) == 2:
            elves[i] = [proposed_moves[i][0], proposed_moves[i][1]]
    answer()
    ans2 += 1
    print(ans2)

ans2 += 1
print(ans2)