From 3ae819ce26969aa48263933c3a412a6051f863fd Mon Sep 17 00:00:00 2001 From: Daniel Weber Date: Wed, 18 Dec 2024 16:20:04 -0500 Subject: [PATCH] Wow, I really messed up my A* like algo....guess we're just doing breadth first search --- 2024/day18/main.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/2024/day18/main.py b/2024/day18/main.py index 58dc7eb..c8daf3a 100644 --- a/2024/day18/main.py +++ b/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