djweber12/advent_of_code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Wow, I really messed up my A* like algo....guess we're just doing

Browse Source 
breadth first search
This commit is contained in:
Daniel Weber 2024-12-18 16:20:04 -05:00
parent 7ea0d33428
commit 3ae819ce26
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
2024/day18/main.py
View File

@ -7,7 +7,7 @@ from python_tools.aoc_utils import *
START = [0,0] START = [0,0]
# INPUTS = ["test.txt", [6,6], 12] # INPUTS = ["test.txt", [6,6], 12]
INPUTS = ["input.txt", [70,70,], 1000] INPUTS = ["input.txt", [70,70,], 1024]
END = INPUTS[1] END = INPUTS[1]
def grid_check(x, i): def grid_check(x, i):
@ -33,7 +33,7 @@ def part_one(input):
if nx == END: if nx == END:
return len(p_list) return len(p_list)
if grid_check(nx, input) and tuple(nx) not in V: if grid_check(nx, input) and tuple(nx) not in V:
h = tuple([mag(sub(END, nx)), *nx]) h = tuple([len(p_list), *nx])
V.add(tuple(nx)) V.add(tuple(nx))
G[h] = [*p_list, nx] G[h] = [*p_list, nx]
return -1 return -1