Toot

Written by gerikson@awful.systems on 2024-12-18 at 08:36

day 18

bit of a breather episode

As long as you ensure A* / Dijkstra’s (is there a functional difference if the edge weights are constant?) you’ll get the shortest path. Part 2 was just simulation for me, if I started in the state of part 1 it took a minute to run through the rest of the bytes.

=> More informations about this toot | View the thread | More toots from gerikson@awful.systems

Mentions

=> View gerikson@awful.systems profile

Tags