smark/adventofcode
1
0
Fork 0
Code Activity

update 2024/day6

Browse source 
better variable names
This commit is contained in:
Sebastian Mark 2024-12-06 15:43:33 +01:00
parent a16162adfd
commit 7803e54583
1 changed files with 14 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
2024/06/main.py
View file

@ -28,7 +28,7 @@ def find_guard(maze: list) -> tuple:
return tuple(-1, -1) return tuple(-1, -1)
def move_guard(maze: list, guard: tuple) -> tuple[int, bool, dict]: def move_guard(maze: list, guard_pos: tuple) -> tuple[int, bool, dict]:
width = len(maze[0]) width = len(maze[0])
height = len(maze) height = len(maze)
@ -36,7 +36,7 @@ def move_guard(maze: list, guard: tuple) -> tuple[int, bool, dict]:
# remember the start position as visited # remember the start position as visited
visited = set() visited = set()
visited.add(guard) visited.add(guard_pos)
# start upwards # start upwards
direction = (0, -1) direction = (0, -1)
@ -44,13 +44,13 @@ def move_guard(maze: list, guard: tuple) -> tuple[int, bool, dict]:
while True: while True:
# get next position # get next position
nxt = ( nxt = (
guard[0] + direction[0], guard_pos[0] + direction[0],
guard[1] + direction[1], guard_pos[1] + direction[1],
) )
# check borders # check borders
if not (0 <= nxt[0] < width and 0 <= nxt[1] < height): if not (0 <= nxt[0] < width and 0 <= nxt[1] < height):
visited.add(guard) visited.add(guard_pos)
break break
# check for obstacle and rotate clockwise # check for obstacle and rotate clockwise
@ -61,13 +61,13 @@ def move_guard(maze: list, guard: tuple) -> tuple[int, bool, dict]:
# loop detection # loop detection
# (has the guard been here and walking in the same direction?) # (has the guard been here and walking in the same direction?)
if nxt not in path_history: if nxt not in path_history:
path_history[nxt] = (guard, direction) path_history[nxt] = (guard_pos, direction)
elif path_history[nxt] == (guard, direction): elif path_history[nxt] == (guard_pos, direction):
return 0, True, {} return 0, True, {}
# mark spot as visited and move guard # mark spot as visited and move guard
visited.add(guard) visited.add(guard_pos)
guard = nxt guard_pos = nxt
return len(visited), False, path_history return len(visited), False, path_history
@ -81,23 +81,23 @@ def print_maze(maze: list):
def main(): def main():
# part 1 # part 1
maze = readinput() maze = readinput()
guard = find_guard(maze) guard_pos = find_guard(maze)
count, _, guard_path = move_guard(maze, guard) count, _, guard_path = move_guard(maze, guard_pos)
print("Guard positions: %d" % count) print("Guard positions: %d" % count)
# part 2 # part 2
count = 0 count = 0
maze = readinput() maze = readinput()
guard = find_guard(maze) guard_pos = find_guard(maze)
# place an obstacle at every position in the guards path # place an obstacle at every position in the guards path
# then check new maze for loop # then check new maze for loop
for col, row in guard_path: for col, row in guard_path:
if (col, row) == guard: if (col, row) == guard_pos:
continue continue
new_maze = deepcopy(maze) new_maze = deepcopy(maze)
new_maze[row][col] = "#" new_maze[row][col] = "#"
_, loop, _ = move_guard(new_maze, guard) _, loop, _ = move_guard(new_maze, guard_pos)
if loop: if loop:
count += 1 count += 1