FrederikBaerentsen/AdventOfCode
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Compare commits

base: FrederikBaerentsen:aaca415d2b7cf1c875f209a00c203b03e0e846b3
Branches Tags
FrederikBaerentsen:master
..
compare: FrederikBaerentsen:ee28498264c1a027ba7935ba7ab8989231c39546
Branches Tags
FrederikBaerentsen:master

No commits in common. "aaca415d2b7cf1c875f209a00c203b03e0e846b3" and "ee28498264c1a027ba7935ba7ab8989231c39546" have entirely different histories.
aaca415d2b ... ee28498264

6 changed files with 23 additions and 71 deletions
Show Stats Expand all files Collapse all files

67
2023/day10/part1.py
View File

@ -78,97 +78,76 @@ while not found:
x = cur[1] x = cur[1]
sub_found = False sub_found = False
#print('Start: ' + str(cur) + ' ' + wall(cur)) print('Start: ' + str(cur) + ' ' + wall(cur))
dirc = '' dirc = ''
#print('Trying to find way') print('Trying to find way')
#print('Previous is ' + str(prev) + wall(prev)) print('Previous is ' + str(prev) + wall(prev))
if y+1 < len(grid[0]) and not sub_found: if y+1 < len(grid[0]) and not sub_found:
#print('Can go right')
# Right # Right
new = (list(cur)[0]+1,list(cur)[1]) new = (list(cur)[0]+1,list(cur)[1])
#print(wall(new))
if grid[x][y+1] in ('─','┐','┘') and new != prev: if grid[x][y+1] in ('─','┐','┘') and new != prev:
#print('Trying Right') print('Trying Right')
#print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new)) print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new))
dirc = 'R' dirc = 'R'
if wall(cur) in ('─','┌','└','S'): if wall(cur) in ('─','┌','└','S'):
if wall(new) == 'S': print('Went Right')
print('Found')
found = True
#print('Went Right')
prev = (y,x) prev = (y,x)
y += 1 y += 1
print(wall(new))
sub_found = True sub_found = True
else:
print('Cant go right cus ' + str(y) + ' < ' + str(len(grid)))
if y > 0 and not sub_found: if y > 0 and not sub_found:
#print('Can go left')
# Left # Left
new = (list(cur)[0]-1,list(cur)[1]) new = (list(cur)[0]-1,list(cur)[1])
if grid[x][y-1] in ('─','┌','└') and new != prev: if grid[x][y-1] in ('─','┌','└') and new != prev:
#print('Trying Left') print('Trying Left')
#print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new)) print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new))
dirc = 'L' dirc = 'L'
if wall(cur) in ('─','┐','┘','S'): if wall(cur) in ('─','┐','┘','S'):
if wall(new) == 'S': print('Went Left')
print('Found')
found = True
#print('Went Left')
prev = (y,x)
y -= 1 y -= 1
print(wall(new))
sub_found = True sub_found = True
else:
print('Cant go left cus ' + str(y) + ' > ' + str(0))
if x > 0 and not sub_found: if x > 0 and not sub_found:
print('Can go up')
# Up # Up
new = (list(cur)[0],list(cur)[1]-1) new = (list(cur)[0],list(cur)[1]-1)
#print(wall(new)) if grid[x-1][y] in ('│','┌','┐') and new != prev:
if grid[x-1][y] in ('│','┌','┐','S') and new != prev:
print('Trying Up') print('Trying Up')
print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new)) print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new))
dirc = 'U' dirc = 'U'
if wall(cur) in ('│','└','┘','S'): if wall(cur) in ('│','└','┘','S'):
print('Went Up') print('Went Up')
if wall(new) == 'S':
print('Found')
found = True
prev = (y,x)
x -=1 x -=1
sub_found = True sub_found = True
if x < len(grid) and not sub_found: if x < len(grid) and not sub_found:
#print('Can go down')
# Down # Down
new = (list(cur)[0],list(cur)[1]+1) new = (list(cur)[0],list(cur)[1]+1)
#print(wall(new)) if grid[x+1][y] in ('│','└','┘') and new != prev:
if grid[x+1][y] in ('│','└','┘','S') and new != prev: print('Trying Down')
#print('Trying Down') print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new))
#print('prev: ' + str(prev) + ' cur: ' + str(cur) + ' new: ' + str(new))
dirc = 'D' dirc = 'D'
if wall(cur) in ('│','┌','┐','S'): if wall(cur) in ('│','┌','┐','S'):
#print('Went Down') print('Went Down')
if wall(new) == 'S':
print('Found')
found = True
prev = (y,x)
x += 1 x += 1
sub_found = True sub_found = True
cur = (y,x) cur = (y,x)
steps.append((x,y)) steps.append((x,y))
p(grid,steps)
print('Going ' + dirc + ' to ' + str(cur) + ' ' + wall(cur)) print('Going ' + dirc + ' to ' + str(cur) + ' ' + wall(cur))
print('Previous is ' + str(prev) + ' ' + wall(prev)) print('Previous is ' + str(prev) + ' ' + wall(prev))
p(grid,steps)
print() print()
input() input()
count += 1 count += 1
#print(cur, start) if cur == start:
p(grid,steps) found = True
print(count) print(count)
print(count/2)

5
2023/day10/t3
View File

@ -1,5 +0,0 @@
..F.F7.
.7.FJ|.
.|SJ.L7
..|F--J
..LJ...

5
2023/day10/t4
View File

@ -1,5 +0,0 @@
7..F.F7.
J.7.FJ|.
F.|SJJ.L7
L..|F--J
...LJL..

5
2023/day10/t5
View File

@ -1,5 +0,0 @@
7..F.F7.
J.F--JL7
F.LS.J.|7
L..|F--J
...LJL..

5
2023/day10/t6
View File

@ -1,5 +0,0 @@
..F.F7.
.7.FJ|.
.|S---7
..|F--J
..LJ...

7
2023/day10/t7
View File

@ -1,7 +0,0 @@
.....---
...F--7.
F7SJ..|.
..F-7||.
..|.L-J.
..L7....
........