From e7bfa1f8dedf0ff6360a162da061a57a3c6c46b2 Mon Sep 17 00:00:00 2001 From: derailed-dash Date: Mon, 22 Jan 2024 21:36:05 +0000 Subject: [PATCH] Typo fix --- src/AoC_2023/Dazbo's_Advent_of_Code_2023.ipynb | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/src/AoC_2023/Dazbo's_Advent_of_Code_2023.ipynb b/src/AoC_2023/Dazbo's_Advent_of_Code_2023.ipynb index dcd3cfd..a56058b 100644 --- a/src/AoC_2023/Dazbo's_Advent_of_Code_2023.ipynb +++ b/src/AoC_2023/Dazbo's_Advent_of_Code_2023.ipynb @@ -6599,7 +6599,6 @@ "\n", "# SETUP LOGGING\n", "logger.setLevel(logging.DEBUG)\n", - "# td.setup_file_logging(logger, locations.output_dir)\n", "\n", "# Retrieve input and store in local file\n", "try:\n", @@ -6648,7 +6647,7 @@ "\n", "I found this one pretty tough.\n", "\n", - "It was pretty obvious from the start that I needed either [Dijkstra’s or A* algorithm][https://aoc.just2good.co.uk/python/shortest_paths] to find the path with the lowest cumulative cost. But the actual implementation took me ages to get right.\n", + "It was pretty obvious from the start that I needed either [Dijkstra’s or A* algorithm](https://aoc.just2good.co.uk/python/shortest_paths) to find the path with the lowest cumulative cost. But the actual implementation took me ages to get right.\n", "\n", "So... We need to find a path from a start to a goal, where the cost varies depending on the path taken. As usual for a Dijkstra, we need to use a [priority queue](https://aoc.just2good.co.uk/python/priority_queues). First, we need to define some way to represent the state of our journey through the map. I'll represent state in a tuple that stores `(cost, current position, direction, straight steps taken)`. It's important that `cost` comes first, because our priority queue pops the next state based on the lowest value of the first item in the tuple.\n", "\n",