magical
/
adventofcode2022
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

day 24 python part 2

main
magical 2022-12-24 10:07:38 -08:00
parent 5acd7b7812
commit 0d50dd1874
1 changed files with 27 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
day24/sol.py
View File

@ -54,9 +54,6 @@ def show(t):
print(''.join(s)) print(''.join(s))
def blocked(x,y,t): def blocked(x,y,t):
H = len(data)-2
W = len(data[y])-2
if not 0 <= y < len(data): if not 0 <= y < len(data):
return True return True
if not 0 <= x < len(data[y]): if not 0 <= x < len(data[y]):
@ -64,6 +61,9 @@ def blocked(x,y,t):
if data[y][x] == '#': if data[y][x] == '#':
return True return True
H = len(data)-2
W = len(data[y])-2
u = 1 + ((x - t)-1)%W u = 1 + ((x - t)-1)%W
if (u,y) in blizzards['>']: if (u,y) in blizzards['>']:
return True return True
@ -82,23 +82,35 @@ def blocked(x,y,t):
return False return False
start = (data[0].index('.'), 0, 0) start = (data[0].index('.'), 0)
goal = (data[-1].index('.'), len(data)-1) goal = (data[-1].index('.'), len(data)-1)
leg_distance = abs(start[0] - goal[0]) + abs(start[1] - goal[1])
def is_goal(node): def is_goal(node):
x, y, t = node x, y, t, legs = node
return (x,y) == goal return (x,y) == goal and legs == 0
def heuristic(node): def heuristic(node):
x, y, t = node x, y, t, legs = node
return abs(goal[0] - x) + abs(goal[1] - y) if legs == 0:
return 0
if legs % 2 == 1:
g = goal
else:
g = start
return (legs-1)*leg_distance + abs(g[0] - x) + abs(g[1] - y)
def neighbors(node): def neighbors(node):
x, y, t = node x, y, t, legs = node
n = [] n = []
if legs % 2 == 1:
g = goal
else:
g = start
def check(dx,dy): def check(dx,dy):
if not blocked(x+dx,y+dy,t+1): if not blocked(x+dx,y+dy,t+1):
n.append((1, (x+dx, y+dy, t+1))) l = legs - ((x+dx,y+dy) == g)
n.append((1, (x+dx, y+dy, t+1, l)))
check(+1,0) check(+1,0)
check(0,+1) check(0,+1)
check(-1,0) check(-1,0)
@ -110,4 +122,8 @@ show(0)
show(1) show(1)
#show((len(data)-2)*(len(data[0])-2)) #show((len(data)-2)*(len(data[0])-2))
print(astar.search(start, is_goal, neighbors, heuristic)) start_node = start + (0, 1)
print(astar.search(start_node, is_goal, neighbors, heuristic))
start_node = start + (0, 3)
print(astar.search(start_node, is_goal, neighbors, heuristic))