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

breadth first search

2024/day18/main.py

@@ -7,7 +7,7 @@ from python_tools.aoc_utils import *
 
 START = [0,0]
 # INPUTS = ["test.txt", [6,6], 12]
-INPUTS = ["input.txt", [70,70,], 1000]
+INPUTS = ["input.txt", [70,70,], 1024]
 END = INPUTS[1]
 
 def grid_check(x, i):
@@ -33,7 +33,7 @@ def part_one(input):
             if nx == END:
                 return len(p_list)
             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))
                 G[h] = [*p_list, nx]
     return -1