Advent-of-Code-2017/day3-2.py at master · sebbele/Advent-of-Code-2017 · 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
# -*- coding: utf-8 -*-
from __future__ import absolute_import, division, print_function

#input function for both python2.7 and 3
def getInput(prompt=''):
    try:
        line = raw_input(prompt)
    except NameError:
        line = input(prompt)
    return line

# What is the first value written that is larger than your puzzle input?

from pprint import pprint
from itertools import cycle
target = getInput('target: ')
target = int(target)

def generateRight():
    # generate right
    global grid
    global currentNum
    end_point = len(grid[0]) + 1
    for i in range(len(grid[0])):
        grid[-1].append(0)
    for i in range(1, end_point):
        actual_y = len(grid) - 1
        currentNum = sumNeighbors([actual_y, i])
        grid[-1][i] = sumNeighbors([actual_y, i])

def generateUpLeft():
    global grid
    global currentNum
    x_length = len(grid[0])
    y_height = len(grid)
    # generate right column
    current_y = -2
    for i in range(y_height):
        if i == y_height - 1:
            grid.insert(0, [0])
            continue
        grid[current_y].append(0)
        current_y -= 1
    # generate top row
    for i in range(len(grid[1]) - 1):
        grid[0].insert(0, 0)
    #insert values into right column
    x_length = len(grid[0])
    y_height = len(grid)
    x_pos = len(grid[0]) - 1
    y_start = len(grid) - 2
    for i in range( y_start, 0, -1):
        currentNum = sumNeighbors([i, x_pos])
        grid[i][x_pos] = sumNeighbors([i, x_pos])

    # insert values into top row
    for i in range( len(grid[0]) - 1, -1, -1):
        currentNum = sumNeighbors([0, i])
        grid[0][i] = sumNeighbors([0, i])

def generateDown():
    global grid
    global currentNum
    x_length = len(grid[0])
    y_height = len(grid)
    # generate left column
    for i in range(y_height):
        grid[i].insert(0, 0)
    grid.append([0])
    # insert values into new column
    for i in range(y_height + 1):
        currentNum = sumNeighbors([i, 0])
        grid[i][0] = sumNeighbors([i, 0])


def sumNeighbors(coords):
    neighbors = []
    # left
    try:
        x_coord = coords[1] - 1
        y_coord = coords[0]
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # right
    try:
        x_coord = coords[1] + 1
        y_coord = coords[0]
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # up
    try:
        y_coord = coords[0] - 1
        x_coord = coords[1]
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # down
    try:
        y_coord = coords[0] + 1
        x_coord = coords[1]
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # right up
    try:
        x_coord = coords[1] + 1
        y_coord = coords[0] - 1
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # left up
    try:
        x_coord = coords[1] - 1
        y_coord = coords[0] - 1
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # right down
    try:
        x_coord = coords[1] + 1
        y_coord = coords[0] + 1
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    # left down
    try:
        x_coord = coords[1] - 1
        y_coord = coords[0] + 1
        if x_coord >= 0 and y_coord >= 0:
            neighbors.append(grid[y_coord][x_coord])
    except:
        pass
    #print("coords: ", coords, "neighbors: ", neighbors)
    return sum(neighbors)

def findIndex(number):
    currentX = 0
    done = False
    while not done:
        for y in range(len(grid)):
            try:
                targetX = grid[y].index(number)
                targetY = y
                done = True
            except ValueError:
                continue
    return [targetY, targetX]

global funcList
funcList = [ generateRight, generateUpLeft, generateDown ]
global grid
grid = [[1]]
global currentNum
currentNum = 1

def generateGrid(target):
    pool = cycle(funcList)
    for f in pool:
        print("doing", f, "target:",target,"currentNum:",currentNum)
        f()
        if currentNum > target:
            break

generateGrid(target)
print("final grid:",grid)
print("current num:", currentNum)